The Szemerédi-Petruska conjecture for a few small values

DOI10.1007/s40879-021-00466-9zbMath1479.05240arXiv2010.01228OpenAlexW3162216047WikidataQ113891387 ScholiaQ113891387MaRDI QIDQ2667158

André E. Kézdy, Adam S. Jobson, Jenő Lehel

Publication date: 24 November 2021

Published in: European Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

3-uniform hypergraph\( \tau \)-critical graph\( \tau \)-critical hypergraphintersecting set pair systemsSzemerédi-Petruska conjecture

Mathematics Subject Classification ID

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

Related Items (3)

An asymptotic resolution of a conjecture of Szemerédi and Petruska ⋮ The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform \(\tau\)-critical hypergraphs ⋮ Eckhoff's problem on convex sets in the plane

Cites Work

• Petruska's question on planar convex sets
• Critical hypergraphs and interesting set-pair systems
• Upper bound on the order of tau-critical hypergraphs
• Eckhoff's problem on convex sets in the plane
• On generalized graphs
• Order plus size of τ‐critical graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The Szemerédi-Petruska conjecture for a few small values