combinatorics / Graph theory
A graph $G$ is maximal non-Hamiltonian if it is non-Hamiltonian but $G + e$ is Hamiltonian for every nonedge $e$. In 1994 Vu Dinh Hoa conjectured a property of $G - V(C)$ for a longest cycle $C$ of such a graph. Disproved by an explicit base graph on 56 vertices, extended to larger orders.
Temporal state
No reconciled state yet.
Append-only history
A graph $G$ is maximal non-Hamiltonian if it is non-Hamiltonian but $G + e$ is Hamiltonian for every nonedge $e$. In 1994 Vu Dinh Hoa conjectured a property of $G - V(C)$ for a longest cycle $C$ of such a graph. Disproved by an explicit base graph on 56 vertices, extended to larger orders.
Research memory
A graph $G$ is maximal non-Hamiltonian if it is non-Hamiltonian but $G + e$ is Hamiltonian for every nonedge $e$. In 1994 Vu Dinh Hoa conjectured a property of $G - V(C)$ for a longest cycle $C$ of such a graph. Disproved by an explicit base graph on 56 vertices, extended to larger orders.
Evidence graph
No public relationships recorded yet.