Title of article :
2-factors in dense graphs Original Research Article
Author/Authors :
Noga Alon، نويسنده , , Eldar Fischer، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1996
Abstract :
A conjecture of Sauer and Spencer states that any graph G on n vertices with minimum degree at least 2/3n contains any graph H on n vertices with maximum degree 2 or less. This conjecture is proven here for all sufficiently large n.
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
