Grünbaum–Nash-Williams conjecture
Statement
A graph is toroidal if it admits an embedding in the torus, i.e. there is a drawing of on the closed orientable surface of genus in which vertices are distinct points, edges are arcs joining their endpoints, and no two edges meet except at a common endpoint. A graph on at least vertices is -vertex-connected (-connected) if it is connected and is connected for every set with . A Hamiltonian cycle of is a cycle in that passes through every vertex of .
For every finite simple graph : if is toroidal and -vertex-connected, then has a Hamiltonian cycle.
Record
- Added
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.