Grünbaum's Hamiltonicity conjecture for 4-connected maps on the torus
Statement
Let be a map on the torus, meaning an embedding of a graph in the torus whose faces are disks meeting pairwise only in a vertex or an edge. A map is 4-connected when its underlying graph remains non-trivially connected after the removal of any three vertices, and it is Hamiltonian when its underlying graph contains a cycle passing through every vertex exactly once.
Grünbaum–Nash-Williams conjecture. Every 4-connected map on the torus is Hamiltonian.
Hamiltonicity is a central question for graphs embedded on surfaces. The analogous conjecture for 4-connected maps on the projective plane was proved by Thomas and Yu, but the torus statement is presented here as unresolved.
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.