Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6424026 | Electronic Notes in Discrete Mathematics | 2011 | 6 Pages |
Abstract
Let ex(n;t) denote the maximum number of edges in a graph G having order n without cycles of length t or less. We prove ex(23;8)=28,ex(24;8)=20 and ex(25;8)=30. Furthermore, we present new lower and upper bounds for n⩽49 and the extremal numbers when known.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Kim Marshall, Mirka Miller, Joe Ryan,