Theorems · Theorem · combinatorics
Graph.Loopless.anti
∀ {α : Type u_1} {β : Type u_2} {G H : Graph α β} [hG : G.Loopless], H ≤ G → H.Loopless- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Graph.Loopless
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Graphstatement and proof · cited by 242
- Graph.Adjproof · cited by 23
- Graph.Looplessstatement and proof · cited by 12
- Graph.Adj.monoproof · cited by 4
- Graph.loopless_iff_forall_ne_of_adjproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.