Bipartite Hansel results for hypergraphs
Bipartite Hansel results for hypergraphs
复制标题
超图的二分 Hansel 结果
DOI:
10.1016/j.ejc.2020.103136
复制
发表时间:
2020
影响因子:
1
通讯作者:
Nagle, Brendan
中科院分区:
文献类型:
--
作者:
Churchill, Gregory;Nagle, Brendan
For integers n≥ k≥ 2, let V be an n-element set, and let V k denote the set of all k-element subsets of V. For disjoint A, B⊆ V, we say {A, B} covers K∈ V k if K⊆ A∪ ̇ B and K meets each of A and B, ie, K∩ A≠ 0̸≠ K∩ B. We say that a collection C of such pairs {A, B} covers V k if every element of V k is covered by at least one member of C. When k= 2, such a family is called a separating system of V, where this concept was introduced by Rényi (1961) and studied by many authors. Let h (n, k) denote the minimum value of∑{A, B}∈ C (| A|+| B|) among all covers C of V k. Hansel (1964) determined the bounds⌈ n log 2 n⌉≤ h (n, 2)≤ n⌈ log 2 n⌉, and Bollobás and Scott (2007) determined an exact formula for h (n, 2). We extend these results to give an exact formula for h (n, k), and to guarantee that all optimal covers C of V k share a common degree-sequence. Our proofs follow lines of Bollobás and Scott, together with weight-shifting arguments in a similar vein to some of Motzkin and Straus (1965).
登录
查看更多内容
DOI:
--
发表时间:
1969
期刊:
影响因子:
--
作者:
T. J. Dickson
通讯作者:
T. J. Dickson
DOI:
--
发表时间:
1970
期刊:
影响因子:
--
作者:
J. Spencer
通讯作者:
J. Spencer
DOI:
--
发表时间:
2001
期刊:
Journal of Combinatorial Theory
影响因子:
--
作者:
André Kündgen;D. Mubayi;P. Tetali
通讯作者:
P. Tetali
DOI:
--
发表时间:
1964
期刊:
影响因子:
--
作者:
R. Krichevskii
通讯作者:
R. Krichevskii
影响因子:
0.3
作者:
P. Erdös
通讯作者:
P. Erdös