Theorems · Theorem · combinatorics
Graph.IsClosedSubgraph.trans
∀ {α : Type u_1} {β : Type u_2} {G G₁ G₂ : Graph α β},
G.IsClosedSubgraph G₁ → G₁.IsClosedSubgraph G₂ → G.IsClosedSubgraph G₂- Defined in
- Mathlib.Combinatorics.Graph.Subgraph
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Graphstatement and proof · cited by 242
- Graph.vertexSetproof · cited by 87
- Graph.Incproof · cited by 42
- Graph.IsClosedSubgraphstatement and proof · cited by 17
- Graph.IsInducedSubgraph.leproof · cited by 12
- Graph.IsSubgraph.vertexSet_monoproof · cited by 12
- Graph.IsClosedSubgraph.isInducedSubgraphproof · cited by 6
- Graph.IsSubgraph.transproof · cited by 3
- Graph.IsClosedSubgraph.mk'proof · cited by 3
- Graph.IsSubgraph.compatible'proof · cited by 2
- Graph.Inc.of_compatibleproof · cited by 2
- Graph.IsClosedSubgraph.closedproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.