Theorems · Theorem · combinatorics
Graph.Compatible.anti
∀ {α : Type u_1} {β : Type u_2} {G G₁ H H₁ : Graph α β}, G₁ ≤ G → H₁ ≤ H → G.Compatible H → G₁.Compatible H₁- Defined in
- Mathlib.Combinatorics.Graph.Subgraph
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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.Compatiblestatement and proof · cited by 21
- Graph.Compatible.anti_leftproof · cited by 2
- Graph.Compatible.anti_rightproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.