ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on nn vertices, and let reg⁡even⁡(G)\operatorname{reg}_{\operatorname{even}}(G) denote the largest degree of an even-regular spanning subgraph of GG. The regular-subgraph conjecture. If

δ(G)≥n2,\delta(G)\ge \frac{n}{2},

then GG contains at least

reg⁡even⁡(G)2\frac{\operatorname{reg}_{\operatorname{even}}(G)}{2}

edge-disjoint Hamilton cycles. This graph-by-graph strengthening of the preceding conjecture is best possible for each individual graph. It was proved when δ≥(2−2+ε)n\delta\ge(2-\sqrt{2}+\varepsilon)n, but remains open 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.