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- Decomposition
- Deconvolution
- Decreasing Function
- Decreasing Sequence
- Decreasing Series
- Dedekind Cut
- Dedekind Eta Function
- Dedekind Function
- Dedekind Ring
- Dedekind's Axiom
- Dedekind's Problem
- Dedekind Sum
- Deducible
- Deep Theorem
- Defective Matrix
- Defective Number
- Deficiency
- Deficient Number
- Definable Set
- Defined
- Definite Integral
- Degenerate
- Degree
- Degree (Algebraic Surface)
- Degree (Map)