Theorems · Theorem · combinatorics
Graph.isClosedSubgraph_bot_iff
∀ {α : Type u_1} {β : Type u_2} {G : Graph α β}, G.IsClosedSubgraph ⊥ ↔ G = ⊥- Defined in
- Mathlib.Combinatorics.Graph.Subgraph
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Bot.botstatement and proof · cited by 4,720
- Graphstatement and proof · cited by 242
- le_bot_iffproof · cited by 116
- Graph.IsClosedSubgraphstatement and proof · cited by 17
- Graph.IsInducedSubgraph.leproof · cited by 12
- Graph.IsClosedSubgraph.isInducedSubgraphproof · cited by 6
- Graph.IsClosedSubgraph.rflproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.