Theorem SimpleGraph.Walk.IsTrail.length_le_card_edgeFinset

Modification history

2025-06-22 12:57
Mathlib/Combinatorics/SimpleGraph/Path.lean
chore(SimpleGraph): split `Combinatorics.SimpleGraph.Path` (#25844) …
Modified SimpleGraph.Walk.IsTrail.length_le_card_edgeFinsetView on Github →
2024-09-03 15:39
Mathlib/Combinatorics/SimpleGraph/Path.lean
feat(Combinatorics/SimpleGraph): darts and edges are injective for walks, length of paths and trails are bounded (#15541) …
Added SimpleGraph.Walk.IsTrail.length_le_card_edgeFinsetView on Github →