Best monotone condition for 2-factor graphs to be Hamiltonian
Statement
Let be a graphical degree sequence, and let be a realization of . Say that contains a -factor if it has a spanning -regular subgraph, and say that is hamiltonian if it contains a cycle through all its vertices. The degree condition in Theorem 45 is the condition
2-factor Hamiltonicity conjecture. This degree condition is a best monotone degree condition for -factor 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.