Title of article
Graphs with large maximum degree containing no odd cycles of a given length
Author/Authors
Balister، نويسنده , , Paul and Bollobلs، نويسنده , , Béla and Riordan، نويسنده , , Oliver and Schelp، نويسنده , , Richard H.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
8
From page
366
To page
373
Abstract
Let us write f(n,Δ;C2k+1) for the maximal number of edges in a graph of order n and maximum degree Δ that contains no cycles of length 2k+1. For n2⩽Δ⩽n−k−1 and n sufficiently large we show that f(n,Δ;C2k+1)=Δ(n−Δ), with the unique extremal graph a complete bipartite graph.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2003
Journal title
Journal of Combinatorial Theory Series B
Record number
1527188
Link To Document