Title of article
Extremal Graphs without Cycles of Length 8 or Less
Author/Authors
Marshall، نويسنده , , Kim S. Miller، نويسنده , , Mirka and Ryan، نويسنده , , Joe، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
6
From page
615
To page
620
Abstract
Let e x ( n ; t ) denote the maximum number of edges in a graph G having order n without cycles of length t or less. We prove e x ( 23 ; 8 ) = 28 , e x ( 24 ; 8 ) = 20 and e x ( 25 ; 8 ) = 30 . Furthermore, we present new lower and upper bounds for n ⩽ 49 and the extremal numbers when known.
Keywords
Extremal graph , extremal number , girth
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2011
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455908
Link To Document