Name
Abstract | ||
|---|---|---|
By the extremal number ex ( n ; t ) = ex ( n ; { C 3 , C 4 , … , C t } ) we denote the maximum size (number of edges) in a graph of n vertices, n > t , and girth (length of shortest cycle) at least g ⩾ t + 1 . In 1975, Erdős proposed the problem of determining the extremal numbers ex ( n ; 4 ) of a graph of n vertices and girth at least 5. In this paper, we consider a generalized version of this problem, for t ⩾ 5 . In particular, we prove that ex ( n ; 6 ) for n = 29 , 30 and 31 is equal to 45, 47 and 49, respectively. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.endm.2009.07.110 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
extremal graph,girth,forbidden cycles,extremal number,size | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Cage,Mathematics,Bounded function | Journal |
Volume | ISSN | Citations |
34 | Electronic Notes in Discrete Mathematics | 0 |
PageRank | References | Authors |
0.34 | 1 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Charles Delorme | 1 | 43 | 23.16 |
| Evelyne Flandrin | 2 | 219 | 25.13 |
| Yuqing Lin | 3 | 115 | 20.75 |
| Mirka Miller | 4 | 530 | 90.29 |
| Joe Ryan | 5 | 49 | 18.22 |