Tutte's conjecture on Hamiltonian cubic bipartite graphs
Statement
Let be a -regular, -connected bipartite graph. Tutte's conjecture. Every such graph is Hamiltonian. The supplied text introduces this conjecture after noting that the known counterexamples to Tait's conjecture were not bipartite; its resolution is not stated in the supplied material.
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.