Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 33-42 |
| Number of pages | 10 |
| Journal | Journal of Combinatorial Theory. Series A |
| Volume | 74 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1996 Apr |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics