High-girth Erdős–Nash-Williams conjecture
Statement
Let be a sufficiently large -divisible graph on vertices, meaning and for every vertex . The girth of a triangle decomposition is the smallest integer for which it contains triangles spanning at most vertices. Erdős–Nash-Williams conjecture. For every integer , if , then admits a -decomposition with girth at least . This combines Nash-Williams' minimum-degree conjecture with Erdős' high-girth conjecture. The source reports only approximate results and states that the exact problem remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.