Theorems · Theorem · combinatorics
SimpleGraph.IsTutteViolator.mono
∀ {V : Type u_1} {G G' : SimpleGraph V} [Finite V] {u : Set V}, G ≤ G' → G'.IsTutteViolator u → G.IsTutteViolator u- Defined in
- Mathlib.Combinatorics.SimpleGraph.Tutte
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 103 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Finite
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
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
- Top.topproof · cited by 9,680
- SimpleGraphstatement and proof · cited by 3,072
- Finitestatement and proof · cited by 3,029
- lt_of_lt_of_leproof · cited by 438
- Set.ncardproof · cited by 344
- SimpleGraph.Subgraph.coeproof · cited by 89
- SimpleGraph.Subgraph.deleteVertsproof · cited by 15
- SimpleGraph.oddComponentsproof · cited by 10
- SimpleGraph.IsTutteViolatorstatement and proof · cited by 6
- SimpleGraph.ncard_oddComponents_monoproof · cited by 1
- SimpleGraph.Subgraph.deleteVerts_mono'proof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.exists_isTutteViolatorproof · cited by 1