ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, let reg⁡even⁡(G)\operatorname{reg}_{\operatorname{even}}(G) be the largest degree of an even-regular spanning subgraph of GG. For integers nn and δ\delta, define

reg⁡even⁡(n,δ):=min⁡{reg⁡even⁡(G):∣G∣=n, δ(G)=δ}.\operatorname{reg}_{\operatorname{even}}(n,\delta):=\min\{\operatorname{reg}_{\operatorname{even}}(G): |G|=n,\ \delta(G)=\delta\}.

Nash-Williams's conjecture. If GG is a graph on nn vertices with minimum degree δ≥n/2\delta\ge n/2, then GG contains at least

reg⁡even⁡(n,δ)2\frac{\operatorname{reg}_{\operatorname{even}}(n,\delta)}{2}

edge-disjoint Hamilton cycles. This is the natural optimal bound based on the largest guaranteed even-regular spanning subgraph; the paper presents it as an open problem in general.

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.