The lower-bound sharpness conjecture for K5<K_5^<

About 5 years old · traced to

Let K5<K_5^< be the 33-graph on five vertices with eight edges whose two missing edges intersect in exactly two vertices. The supplied bounds are

59≤π(K5<),13≤σ(K5<),12≤π2(K5<),and12≤πu(K5<).\frac{5}{9}\leq\pi(K_5^<),\quad \frac{1}{3}\leq\sigma(K_5^<),\quad \frac{1}{2}\leq\pi_2(K_5^<),\quad\text{and}\quad \frac{1}{2}\leq\pi_u(K_5^<).

The lower-bound sharpness conjecture for K5<K_5^<. All four lower bounds are sharp:

π(K5<)=59,σ(K5<)=13,π2(K5<)=12,andπu(K5<)=12.\pi(K_5^<)=\frac{5}{9},\qquad \sigma(K_5^<)=\frac{1}{3},\qquad \pi_2(K_5^<)=\frac{1}{2},\qquad\text{and}\qquad \pi_u(K_5^<)=\frac{1}{2}.

The text gives flag-algebra upper bounds that are strictly above these lower bounds, so the conjecture remains open in the supplied material.

References

Primary source

József Balogh, Felix Christian Clemen and Bernard Lidický, “Hypergraph Turán Problems in _2-Norm”, arXiv:2108.10406 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.