Hoàng's degree-sequence conjecture for tough graphs
Statement
Let be a simple graph. Write for its number of components, and define its toughness by
when is not complete, with otherwise. The graph is -tough if . Let be the degree sequence of an -vertex graph .
Hoàng's conjecture. Let and be integers. If is -tough and, for every , implies , then is Hamiltonian.
This conjecture is a toughness analogue of Chvátal's degree-sequence theorem. Hoàng proved it for , Hoàng and Robin proved it for , and the source states that it has been confirmed for all ; thus the conjecture is solved.
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.