Theorems · Theorem · combinatorics
Graph.Compatible.of_ge
∀ {α : Type u_1} {β : Type u_2} {G H : Graph α β}, G ≤ H → H.Compatible G- Defined in
- Mathlib.Combinatorics.Graph.Subgraph
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 63 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.
- le_rflproof · cited by 1,558
- Graphstatement and proof · cited by 242
- Graph.Compatiblestatement · cited by 21
- Graph.Compatible.of_le_leproof · cited by 9
Cited by1
Results whose statement or proof uses this declaration.
- Graph.IsSubgraph.compatible'proof · cited by 2