Theorems · Theorem · combinatorics
SimpleGraph.not_isHamiltonian_of_isEmpty
∀ {α : Type u_1} [inst : DecidableEq α] {G : SimpleGraph α} [inst_1 : Fintype α] [IsEmpty α], ¬G.IsHamiltonian- Cited by
- 0 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqFintypeIsEmpty
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.
- Fintypestatement and proof · cited by 7,736
- SimpleGraphstatement and proof · cited by 3,072
- IsEmptystatement and proof · cited by 759
- Fintype.card_eq_zeroproof · cited by 22
- SimpleGraph.IsHamiltonianstatement and proof · cited by 10
- IsEmpty.exists_iffproof · cited by 7
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.