Theorems · Theorem · combinatorics
Graph.Compatible.refl
∀ {α : Type u_1} {β : Type u_2} (G : Graph α β), G.Compatible G- Defined in
- Mathlib.Combinatorics.Graph.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 5 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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.edgeSetproof · cited by 79
- Graph.Compatiblestatement · cited by 21
Cited by1
Results whose statement or proof uses this declaration.
- Graph.Compatible.rflproof · cited by 0