Theorems · Theorem · combinatorics
SimpleGraph.interedges_disjoint_left
∀ {α : Type u_4} (G : SimpleGraph α) [inst : DecidableRel G.Adj] {s₁ s₂ : Finset α},
Disjoint s₁ s₂ → ∀ (t : Finset α), Disjoint (G.interedges s₁ t) (G.interedges s₂ t)- Cited by
- 0 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableRel
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- SimpleGraphstatement and proof · cited by 3,072
- Disjointstatement and proof · cited by 2,201
- SimpleGraph.Adjstatement and proof · cited by 1,346
- SimpleGraph.interedgesstatement · cited by 23
- Rel.interedges_disjoint_leftproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.