The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform \(\tau\)-critical hypergraphs
From MaRDI portal
Publication:6166161
DOI10.1007/s40879-023-00660-xzbMath1528.05068arXiv2204.02859OpenAlexW4384698624WikidataQ123106455 ScholiaQ123106455MaRDI QIDQ6166161
Publication date: 2 August 2023
Published in: European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.02859
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
- The Szemerédi-Petruska conjecture for a few small values
- A Theorem on k-Saturated Graphs
- On generalized graphs
- An asymptotic resolution of a conjecture of Szemerédi and Petruska
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform \(\tau\)-critical hypergraphs