Theorems · Theorem · combinatorics
SimpleGraph.IsTutteViolator.empty
∀ {V : Type u_1} {G : SimpleGraph V} [Finite V], Odd (Nat.card V) → G.IsTutteViolator ∅- Defined in
- Mathlib.Combinatorics.SimpleGraph.Tutte
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 101 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.
Cites18
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Top.topproof · cited by 9,680
- Set.Elemproof · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- Finitestatement and proof · cited by 3,029
- Nat.cardstatement and proof · cited by 844
- Oddstatement and proof · cited by 364
- Set.ncardproof · cited by 344
- SimpleGraph.Subgraph.vertsproof · cited by 210
- SimpleGraph.Subgraph.coeproof · cited by 89
- Set.ncard_univproof · cited by 21
- SimpleGraph.Subgraph.deleteVertsproof · cited by 15
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.tutteproof · cited by 0