Theorems · Theorem · combinatorics
SimpleGraph.isContained_top_iff
∀ {V : Type u_1} {W : Type u_2} {G : SimpleGraph V}, G.IsContained (SimpleGraph.completeGraph W) ↔ Nonempty (V ↪ W)- Defined in
- Mathlib.Combinatorics.SimpleGraph.Copy
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- Function.Embeddingstatement and proof · cited by 988
- le_topproof · cited by 411
- Nonempty.someproof · cited by 340
- SimpleGraph.IsContainedstatement and proof · cited by 68
- SimpleGraph.completeGraphstatement and proof · cited by 49
- SimpleGraph.Copy.toEmbeddingproof · cited by 9
- SimpleGraph.Embedding.completeGraphproof · cited by 9
- SimpleGraph.IsContained.transproof · cited by 9
- SimpleGraph.Embedding.toCopyproof · cited by 7
- SimpleGraph.IsContained.of_leproof · cited by 6
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.