We discuss the maximum size of uniform intersecting families with covering number at least τ. Among others, we construct a large k-uniform intersecting family with covering number k, which provides a counterexample to a conjecture of Lovász. The construction for odd k can be visualized on an annulus, while for even k on a Möbius band. © 1996 Academic Press, Inc.
CITATION STYLE
Frankl, P., Ota, K., & Tokushige, N. (1996). Covers in uniform intersecting families and a counterexample to a conjecture of Lovász. Journal of Combinatorial Theory. Series A, 74(1), 33–42. https://doi.org/10.1006/jcta.1996.0035
Mendeley helps you to discover research relevant for your work.