Cantor’s theorem theorem
Corollary
By Zermelo-Frankel set theory, no set can contain itself as it would contradict the Axiom of Regularity
Powerset of a dominant set is dominant lemma
Euler & Hamiltonian cycles
Euler cycle and Euler tour definition
Existence of an Euler cycle lemma
Corollary
Hamilton path & cycle definition
Determining whether a graph contains a Hamiltonian cycle/path is an NP-hard problem Finding the minimal Hamiltonian cycle/path in the weighted graph is also an NP-hard problem