Covers in uniform intersecting families and a counterexample to a conjecture of Lovász

Peter Frankl, Katsuhiro Ota, Norihide Tokushige

Research output: Contribution to journalArticle

13 Citations (Scopus)

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 languageEnglish
Pages (from-to)33-42
Number of pages10
JournalJournal of Combinatorial Theory. Series A
Volume74
Issue number1
DOIs
Publication statusPublished - 1996 Apr

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this