An asymptotic resolution of a conjecture of Szemerédi and Petruska

DOI10.1016/J.DISC.2023.113469zbMath1515.05132arXiv2208.11573OpenAlexW4366607789WikidataQ123359761 ScholiaQ123359761MaRDI QIDQ6041571

Jenő Lehel, André E. Kézdy

Publication date: 31 May 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.11573

zbMATH Keywords

extremal set theoryhypergraphstransversal number

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Transversal (matching) theory (05D15)

Related Items (1)

The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform \(\tau\)-critical hypergraphs

Cites Work

• Unnamed Item
• Intersection patterns of convex sets
• Critical hypergraphs and interesting set-pair systems
• An extremal problem for two families of sets
• Upper bound on the order of tau-critical hypergraphs
• The Szemerédi-Petruska conjecture for a few small values
• On generalized graphs

This page was built for publication: An asymptotic resolution of a conjecture of Szemerédi and Petruska