An upper bound for the size of a k-uniform intersecting family with covering number k

Journal of Combinatorial Theory, Series A - Tập 147 - Trang 18-26 - 2017
Andrii Arman1, Troy Retter2
1University of Manitoba, 420 Machray Hall, 186 Dysart Rd., Winnipeg, MB, R3T 2N2, Canada
2Emory University, 201 Dowman Dr, Atlanta, GA 30322, USA

Tài liệu tham khảo

Erdős, 1975, Problems and results on 3-chromatic hypergraphs and some related questions, vol. 10, 609 Frankl, 1996, Covers in uniform intersecting families and a counterexample to a conjecture of Lovász, J. Combin. Theory Ser. A, 74, 33, 10.1006/jcta.1996.0035 Tuza, 1994, Inequalities for minimal covering sets in set systems of given rank, Discrete Appl. Math., 51, 187, 10.1016/0166-218X(94)90108-2