Theorems · Definition · combinatorics
SimpleGraph.completeMultipartiteGraph.topEmbedding
{ι : Type u_3} → (V : ι → Type u_4) → ((i : ι) → V i) → ⊤ ↪g SimpleGraph.completeMultipartiteGraph VEmbedding of the complete graph on ι into completeMultipartiteGraph on ι nonempty parts
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Clique
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 64 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.
- Top.topstatement · cited by 9,680
- SimpleGraphstatement · cited by 3,072
- SimpleGraph.Embeddingstatement · cited by 41
- SimpleGraph.completeMultipartiteGraphstatement · cited by 11
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.completeMultipartiteGraph.not_cliqueFree_of_le_cardproof · cited by 3
- SimpleGraph.completeMultipartiteGraph.not_cliqueFree_of_infiniteproof · cited by 2
- SimpleGraph.completeMultipartiteGraph.topEmbedding_apply_fststatement and proof · cited by 0
- SimpleGraph.completeMultipartiteGraph.topEmbedding_apply_sndstatement and proof · cited by 0