Theorem SimpleGraph.top_connected

Modification history

2025-09-23 06:31
Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean
feat: the complete graph is connected iff nonempty (#29901) …
Deleted SimpleGraph.top_connectedView on Github →
2025-06-22 12:57
Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean
chore(SimpleGraph): split `Combinatorics.SimpleGraph.Path` (#25844) …
Modified SimpleGraph.top_connectedView on Github →
2024-07-30 05:14
Mathlib/Combinatorics/SimpleGraph/Path.lean
refactor(Combinatorics/SimpleGraph): move `Walk` to its own file (#15171) …
Modified SimpleGraph.top_connectedView on Github →
2023-08-14 12:56
Mathlib/Combinatorics/SimpleGraph/Connectivity.lean
feat: lemmas about connectivity of subgraphs and induced graphs (#5927) …
Added SimpleGraph.top_connectedView on Github →