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

DOI10.1006/jcta.1996.0035zbMath0846.05094OpenAlexW1993221350WikidataQ123343750 ScholiaQ123343750MaRDI QIDQ1913995

Katsuhiro Ota, Norihide Tokushige, Peter Frankl

Publication date: 9 July 1996

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

Full work available at URL: https://semanticscholar.org/paper/7dab0f20d161fb4f424cd5aee2bb9db03d395486

zbMATH Keywords

covering numberconjecture of Lovászuniform intersecting families

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (17)

A new construction of non-extendable intersecting families of sets ⋮ Uniform intersecting families with covering number four ⋮ Pseudo sunflowers ⋮ The intersection spectrum of 3‐chromatic intersecting hypergraphs ⋮ Triangles in intersecting families ⋮ Independence numbers of Johnson-type graphs ⋮ Extremal problems in hypergraph colourings ⋮ Uniform intersecting families with large covering number ⋮ Covers in 4-uniform intersecting families with covering number three ⋮ An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\) ⋮ Diversity ⋮ A note on a series of families constructed over the cyclic graph ⋮ The Cayley isomorphism property for Cayley maps ⋮ Coloring cross-intersecting families ⋮ Invitation to intersection problems for finite sets ⋮ The structure of large non-trivial \(t\)-intersecting families of finite sets ⋮ A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families

This page was built for publication: Covers in uniform intersecting families and a counterexample to a conjecture of Lovász