The lower-bound sharpness conjecture for
The lower-bound sharpness conjecture for
Let be the -graph on five vertices with eight edges whose two missing edges intersect in exactly two vertices. The supplied bounds are
The lower-bound sharpness conjecture for . All four lower bounds are sharp:
The text gives flag-algebra upper bounds that are strictly above these lower bounds, so the conjecture remains open in the supplied material.
Sources & referencesView supporting material
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
Sign in to submit a solution.
No solutions have been posted yet.