Theorems · Theorem · combinatorics
SimpleGraph.TripartiteFromTriangles.toTriangle_is3Clique
∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} {t : Finset (α × β × γ)} {x : α × β × γ} [inst : DecidableEq α]
[inst_1 : DecidableEq β] [inst_2 : DecidableEq γ],
x ∈ t → (SimpleGraph.TripartiteFromTriangles.graph t).IsNClique 3 (SimpleGraph.TripartiteFromTriangles.toTriangle x)- Cited by
- 3 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.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Finsetstatement and proof · cited by 13,712
- Function.Embeddingstatement · cited by 988
- SimpleGraph.IsNCliquestatement and proof · cited by 64
- SimpleGraph.TripartiteFromTriangles.graphstatement and proof · cited by 27
- SimpleGraph.TripartiteFromTriangles.toTrianglestatement · cited by 12
- SimpleGraph.TripartiteFromTriangles.toTriangle_applyproof · cited by 4
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.TripartiteFromTriangles.is3Clique_iffproof · cited by 2
- SimpleGraph.TripartiteFromTriangles.locallyLinearproof · cited by 0
- SimpleGraph.TripartiteFromTriangles.farFromTriangleFreeproof · cited by 0