Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.TripartiteFromTriangles.card_triangles

∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} (t : Finset (α × β × γ)) [inst : DecidableEq α] [inst_1 : DecidableEq β]
  [inst_2 : DecidableEq γ] [inst_3 : Fintype α] [inst_4 : Fintype β] [inst_5 : Fintype γ]
  [SimpleGraph.TripartiteFromTriangles.NoAccidental t],
  ((SimpleGraph.TripartiteFromTriangles.graph t).cliqueFinset 3).card = t.card
Defined in
Mathlib.Combinatorics.SimpleGraph.Triangle.Tripartite
Cited by
2 results in Mathlib
Foundations
Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidableEqDecidableEqDecidableEqFintypeFintypeFintypeSimpleGraph.TripartiteFromTriangles.NoAccidental
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

corners_theorem · cited by 2corners_theoremaddRothNumber_le_ruzsaSzemerediNumber · cited by 1addRothNumber_le_ruzsaSze…Finset · cited by 13712FinsetFintype · cited by 7736FintypeFinset.card · cited by 2327Finset.cardFinset.card_map · cited by 114Finset.card_mapSimpleGraph.TripartiteFromTriangles.graph · cited by 27TripartiteFromTriangles.g…SimpleGraph.cliqueFinset · cited by 26SimpleGraph.cliqueFinsetSimpleGraph.TripartiteFromTriangles.toTriangle · cited by 12TripartiteFromTriangles.t…SimpleGraph.TripartiteFromTriangles.NoAccidental · cited by 10TripartiteFromTriangles.N…SimpleGraph.TripartiteFromTriangles.cliqueFinset_eq_map · cited by 1TripartiteFromTriangles.c…TripartiteFromTriangles.card_…CITED BYCITES

Cites9

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.