Theorem SimpleGraph.Reachable.exists_isPath

Modification history

2025-06-22 12:57

Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean

chore(SimpleGraph): split `Combinatorics.SimpleGraph.Path` (#25844) …

Modified SimpleGraph.Reachable.exists_isPath View on Github →

2025-03-28 14:56

Mathlib/Combinatorics/SimpleGraph/Path.lean

feat(SimpleGraph): a connected graph with n - 1 edges is a tree (#23399) …

Added SimpleGraph.Reachable.exists_isPath View on Github →