Theorems · Inductive type · combinatorics
SimpleGraph.TripartiteFromTriangles.Rel
{α : Type u_1} → {β : Type u_2} → {γ : Type u_3} → Finset (α × β × γ) → α ⊕ β ⊕ γ → α ⊕ β ⊕ γ → PropThe underlying relation of the tripartite-from-triangles graph. Two vertices are related iff there exists a triangle index containing them both.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.TripartiteFromTriangles.graphproof · cited by 27
- SimpleGraph.TripartiteFromTriangles.Rel.casesOnstatement and proof · cited by 15
- SimpleGraph.TripartiteFromTriangles.Rel.recOnstatement and proof · cited by 0
- SimpleGraph.TripartiteFromTriangles.rel_iffstatement and proof · cited by 0