ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a sufficiently large K3K_3-divisible graph on nn vertices, meaning 3∣e(G)3\mid e(G) and 2∣dG(v)2\mid d_G(v) for every vertex vv. The girth of a triangle decomposition is the smallest integer gg for which it contains gg triangles spanning at most g+2g+2 vertices. Erdős–Nash-Williams conjecture. For every integer gg, if δ(G)≥3n/4\delta(G)\geq 3n/4, then GG admits a K3K_3-decomposition with girth at least gg. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.