Theorems · Theorem · combinatorics
SimpleGraph.ConnectedComponent.maximal_connected_toSubgraph
∀ {V : Type u} {G : SimpleGraph V} (C : G.ConnectedComponent), Maximal SimpleGraph.Subgraph.Connected C.toSubgraph- Cited by
- 1 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- le_transproof · cited by 985
- SimpleGraph.Subgraphstatement and proof · cited by 326
- Maximalstatement · cited by 211
- SimpleGraph.Subgraph.vertsproof · cited by 210
- SimpleGraph.ConnectedComponentstatement and proof · cited by 86
- SimpleGraph.connectedComponentMkproof · cited by 40
- SimpleGraph.Connected.preconnectedproof · cited by 28
- SimpleGraph.Subgraph.Connectedstatement and proof · cited by 24
- SimpleGraph.Subgraph.homproof · cited by 18
- SimpleGraph.Reachable.mapproof · cited by 14
- SimpleGraph.ConnectedComponent.soundproof · cited by 9
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.ConnectedComponent.maximal_subgraph_connected_iffproof · cited by 0