A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families

DOI10.1017/S0963548319000142zbMath1436.05081OpenAlexW2948627146WikidataQ115562799 ScholiaQ115562799MaRDI QIDQ5222551

Peter Frankl

Publication date: 6 April 2020

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548319000142

zbMATH Keywords

maximal intersecting \(k\)-graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (4)

Pseudo sunflowers ⋮ Extremal problems in hypergraph colourings ⋮ Uniform intersecting families with large covering number ⋮ Diversity

Cites Work

• An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
• Inequalities for minimal covering sets in set systems of given rank
• Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
• Unnamed Item

This page was built for publication: A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families