Heinig's Hamilton-generated conjecture for dense balanced bipartite graphs
Statement
Let be a balanced bipartite graph with vertices, and write for its minimum degree. Heinig's conjecture. If is sufficiently large and
then is Hamilton-generated, meaning that its cycle space is generated by its Hamiltonian cycles. The source presents this as an interesting problem posed by Heinig; no resolution is supplied there.
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.