Theorems · Theorem · combinatorics
SimpleGraph.IsBipartiteWith.disjoint
∀ {V : Type u_1} {G : SimpleGraph V} {s t : Set V}, G.IsBipartiteWith s t → Disjoint s t- Cited by
- 11 results in Mathlib
- Foundations
- Depth 60 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.
- Setstatement and proof · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- Disjointstatement · cited by 2,201
- SimpleGraph.IsBipartiteWithstatement and proof · cited by 42
Cited by11
Results whose statement or proof uses this declaration.
- SimpleGraph.IsBipartiteWith.isBipartiteproof · cited by 3
- SimpleGraph.IsBipartiteWith.symmproof · cited by 3
- SimpleGraph.IsBipartiteWith.mem_of_mem_adjproof · cited by 2
- SimpleGraph.IsBipartiteWith.mem_of_mem_adj'proof · cited by 2
- SimpleGraph.isBipartiteWith_neighborSet_disjointproof · cited by 1
- SimpleGraph.isBipartiteWith_neighborSet_disjoint'proof · cited by 1
- SimpleGraph.isBipartiteWith_sum_degrees_eq_card_edgesproof · cited by 1
- SimpleGraph.exists_bijective_of_forall_ncard_leproof · cited by 1
- SimpleGraph.exists_isMatching_of_forall_ncard_leproof · cited by 0
- SimpleGraph.IsBipartite.four_mul_encard_edgeSet_leproof · cited by 0
- SimpleGraph.exists_isPerfectMatching_of_forall_ncard_leproof · cited by 0