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

08/24/2022
by   André E. Kézdy, et al.
0

Consider a 3-uniform hypergraph of order n with clique number k such that the intersection of all its k-cliques is empty. Szemerédi and Petruska proved n≤ 8m^2+3m, for fixed m=n-k, and they conjectured the sharp bound n ≤m+2 2. This problem is known to be equivalent to determining the maximum order of a τ-critical 3-uniform hypergraph with transversal number m (details may also be found in a companion paper: arXiv:2204.02859). The best known bound, n≤3/4m^2+m+1, was obtained by Tuza using the machinery of τ-critical hypergraphs. Here we propose an alternative approach, a combination of the iterative decomposition process introduced by Szemerédi and Petruska with the skew version of Bollobás's theorem on set pair systems. The new approach improves the bound to n≤m+2 2 + O(m^5/3), resolving the conjecture asymptotically.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/13/2022

Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number

Let ℋ(k,n,p) be the distribution on k-uniform hypergraphs where every su...
research
06/10/2023

Linear saturation numbers of Berge-C_3 and Berge-C_4

The linear saturation number sat^lin_k(n,ℱ) (linear extremal number ex^l...
research
09/09/2022

Spectral hypergraph sparsification via chaining

In a hypergraph on n vertices where D is the maximum size of a hyperedge...
research
10/07/2022

The Park-Pham Theorem with Optimal Convergence Rate

Park and Pham's recent proof of the Kahn–Kalai conjecture was a major br...
research
11/06/2019

A local epsilon version of Reed's Conjecture

In 1998, Reed conjectured that every graph G satisfies χ(G) ≤1/2(Δ(G) + ...
research
05/29/2022

A note on hardness of promise hypergraph colouring

We show a slightly simpler proof the following theorem by I. Dinur, O. R...
research
09/01/2020

Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture

A well-known conjecture of Füredi, Kahn, and Seymour (1993) on non-unifo...

Please sign up or login with your details

Forgot password? Click here to reset