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

DOI10.1016/j.jcta.2016.11.001zbMath1352.05136arXiv1604.04686OpenAlexW2963257168MaRDI QIDQ501681

Andrii Arman, Troy Retter

Publication date: 9 January 2017

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.04686

zbMATH Keywords

intersecting familytransversalcovering numberintersecting hypergraphblocking number

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15)

Related Items

Pseudo sunflowers, Independence numbers of Johnson-type graphs, Extremal problems in hypergraph colourings, The Cayley isomorphism property for Cayley maps, Coloring cross-intersecting families, A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families

Cites Work

• Inequalities for minimal covering sets in set systems of given rank
• Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
• Unnamed Item