The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 33-uniform ττ-critical hypergraphs

preprint2022arXivOpen access

Abstract

Recently we asymptotically resolved the long-standing Szemerédi and Petruska conjecture. Several decades ago Gyárfás et al. observed, via a straightforward but unpublished argument, that this conjecture is equivalent to the problem of determining the maximum order of a 33-uniform ττ-critical hypergraph. Consequently, an asymptotically tight upper bound for the maximum order of a 33-uniform ττ-critical hypergraph follows from our recent work, reawakening interest in this equivalence. In this companion paper we supply a simple proof of this equivalence. We also present related background with open problems, and mention combinatorial geometry applications of the Szemerédi and Petruska conjecture.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.