Pósa's Theorem
Let 
be a Simple Graph with 
Vertices.
- 1. If, for every
in 
, the number of Vertices of Valency notexceeding is less than , and - 2. If, for Odd, the number of Vertices with Valency not exceeding
isless than or equal to ,
contains a Hamiltonian Circuit.See also Hamiltonian Circuit- Zig Number
- Zigzag Permutation
- Zig-Zag Triangle
- Zillion
- Zipf's Law
- Z-Number
- Zollner's Illusion
- Zonal Harmonic
- Zone
- Zonohedron
- Zonotype
- Zorn's Lemma
- z-Score
- Zsigmondy Theorem
- Z-Transform
- z-Transform
- z-Transform (Population)
- Embeddable Knot
- Embedding
- Empty Set
- e-Multiperfect Number
- Enantiomer
- Enantiomorph
- Encoding
- Endogenous Variable