Theorems · Theorem · combinatorics
SimpleGraph.not_free
∀ {α : Type u_4} {β : Type u_5} {A : SimpleGraph α} {B : SimpleGraph β}, ¬A.Free B ↔ A.IsContained B- Defined in
- Mathlib.Combinatorics.SimpleGraph.Copy
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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
- SimpleGraph.IsContainedstatement · cited by 68
- SimpleGraph.Freestatement · cited by 39
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.cliqueFree_iff_top_freeproof · cited by 0