Skip to content

feat(Combinators/SimpleGraph/Hamiltonian): p.support.length = Fintype.card α #30206

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open

feat(Combinators/SimpleGraph/Hamiltonian): p.support.length = Fintype.card α #30206

Changes from 2 commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
71d2265
feat(Combinators/SimpleGraph/Hamiltonian): `p.support.length = Fintyp…
SnirBroshi Oct 11, 2025
4aee8ca
chore(Combinatorics/SimpleGraph/Hamiltonian): golf `support_length_eq`
SnirBroshi Oct 11, 2025
970be23
chore(Combinatorics/SimpleGraph/Hamiltonian): rename `support_length_…
SnirBroshi Oct 18, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 6 additions & 0 deletions Mathlib/Combinatorics/SimpleGraph/Hamiltonian.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -69,6 +69,12 @@ lemma IsHamiltonian.length_eq (hp : p.IsHamiltonian) : p.length = Fintype.card
rw [← length_support, ← List.sum_toFinset_count_eq_length, Finset.sum_congr rfl fun _ _ ↦ hp _,
← card_eq_sum_ones, hp.support_toFinset, card_univ]

/-- The length of the support of a Hamiltonian path equals the number of vertices of the graph. -/
lemma IsHamiltonian.support_length_eq (hp : p.IsHamiltonian) :
p.support.length = Fintype.card α := by
have : Inhabited α := ⟨a⟩
grind [Fintype.card_ne_zero, length_support, length_eq]

end

/-- A Hamiltonian cycle is a cycle that visits every vertex once. -/
Expand Down