Theorem SimpleGraph.Walk.isHamiltonianCycle_iff_isCycle_and_length_eq_natCard

Modification history

2026-09-30 15:24
Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean
feat(Combinatorics/SimpleGraph/Hamiltonian): a graph with a Hamiltonian path is connected (#41435) …
Added SimpleGraph.Walk.isHamiltonianCycle_iff_isCycle_and_length_eq_natCardView on Github →