Nine-vertex 2-core conjecture for Steiner triple systems
Nine-vertex 2-core conjecture for Steiner triple systems
A Steiner triple system is a 3-uniform hypergraph in which every pair of vertices lies in exactly one edge. A 2-core is a hypergraph with minimum degree .
Nine-vertex 2-core conjecture. Every sufficiently large Steiner triple system contains a 2-core on nine vertices.
The conjecture is motivated by observations that all Steiner triple systems of size with a non-trivial automorphism group contain a grid, as well as by the Brown–Erdős–Sós conjecture and known results that every Steiner triple system contains a core on at most ten vertices. Its status is open.
Sources & referencesView supporting material
Primary source
Jozsef Solymosi, “On the Turán number of the G_33 in linear hypergraphs”, arXiv:2504.16973 (2025).
Progress summary
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.