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

Peter Frankl, Katsuhiro Ota, Norihide Tokushige

研究成果: Article査読

15 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)33-42
ページ数10
ジャーナルJournal of Combinatorial Theory. Series A
74
1
DOI
出版ステータスPublished - 1996 4

ASJC Scopus subject areas

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

フィンガープリント 「Covers in uniform intersecting families and a counterexample to a conjecture of Lovász」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル