分解1-Sperner超图
Decomposing 1-Sperner hypergraphs
摘要:
一个超图是Sperner的,如果没有一个超边包含另一个超边。一个Sperner超图是可均衡的(分别是,阈值)如果其超边的特征向量是线性方程的(最小)二元解(分别地,不等式),具有正系数。这些组合概念有许多应用,并受到布尔函数和整数规划理论的启发。本文引入了一类$1$ -Sperner超图,它的定义是对每两个超边,它们的两个集差中最小的是1.我们利用分解定理刻画了这类Sperner超图,并由此得到了几个结果,特别是得到了$1$ -Sperner超图及其横截超图的大小的界,证明了超边的特征向量在实数上线性无关,并证明了$1$ -Sperner超图是阈值的和可均衡的. $1$ -Sperner超图的研究也是由它们在图论中的应用所激发的,我们在一篇配套论文中提出了这些应用。
英文摘要:
A hypergraph is Sperner if no hyperedge contains another one. A Sperner hypergraph is equilizable (resp., threshold) if the characteristic vectors of its hyperedges are the (minimal) binary solutions to a linear equation (resp., inequality) with positive coefficients. These combinatorial notions have many applications and are motivated by the theory of Boolean functions and integer programming. We introduce in this paper the class of $1$-Sperner hypergraphs, defined by the property that for every two hyperedges the smallest of their two set differences is of size one. We characterize this class of Sperner hypergraphs by a decomposition theorem and derive several consequences from it. In particular, we obtain bounds on the size of $1$-Sperner hypergraphs and their transversal hypergraphs, show that the characteristic vectors of the hyperedges are linearly independent over the reals, and prove that $1$-Sperner hypergraphs are both threshold and equilizable. The study of $1$-Sperner hypergraphs is motivated also by their applications in graph theory, which we present in a companion paper.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。