Pósa's Theorem
Let
be a
Simple Graph
with
Vertices
.
1. If, for every
in
, the number of
Vertices
of
Valency
not exceeding
is less than
, and
2. If, for
Odd
, the number of
Vertices
with
Valency
not exceeding
is less than or equal to
,
then
contains a
Hamiltonian Circuit
.
See also
Hamiltonian Circuit
© 1996-9
Eric W. Weisstein
1999-05-26