ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let π=(d1≤⋯≤dn)\pi=(d_1\le\cdots\le d_n) be a graphical degree sequence, and let GG be a realization of π\pi. Say that GG contains a 22-factor if it has a spanning 22-regular subgraph, and say that GG is hamiltonian if it contains a cycle through all its vertices. The degree condition in Theorem 45 is the condition

di≤i  ⇒  dn−i≥n−i,1≤i≤12(n−3),d_i\le i\;\Rightarrow\;d_{n-i}\ge n-i,\quad 1\le i\le\tfrac12(n-3), di−1≤i  ⇒  dn−i≥12(n+1),1≤i≤12(n−5), if n is odd,d_{i-1}\le i\;\Rightarrow\;d_{n-i}\ge\tfrac12(n+1),\quad 1\le i\le\tfrac12(n-5),\text{ if }n\text{ is odd}, di−1≤i  ⇒  dn/2−1≥12n  ∨  dn−i≥12n+1,1≤i≤12(n−4), if n is even.d_{i-1}\le i\;\Rightarrow\;d_{n/2-1}\ge\tfrac12n\;\vee\;d_{n-i}\ge\tfrac12n+1,\quad 1\le i\le\tfrac12(n-4),\text{ if }n\text{ is even}.

2-factor Hamiltonicity conjecture. This degree condition is a best monotone degree condition for 22-factor ⇒\Rightarrow hamiltonian. The source states that a best monotone condition for this implication is not currently known; the conjecture 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.