Exact values of ex(v; {C-3, C-4, ... , C-n})
For integers n ≥ 4 and ν ≥ n+1, let ex(ν; {C3, C4, . . . , Cn}) denote the maximum number of edges in a graph with ν vertices and girth at least n + 1. In this paper we have obtained bounds on this function for n ∈ {5, 6, 7} and, in several cases, even the exact value. We have also developed a greed...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2010 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/163487 |
| Acceso en línea: | https://hdl.handle.net/11441/163487 https://doi.org/10.1016/j.dam.2010.08.002 |
| Access Level: | acceso abierto |
| Palabra clave: | Extremal graphs Girth Cages |
| Sumario: | For integers n ≥ 4 and ν ≥ n+1, let ex(ν; {C3, C4, . . . , Cn}) denote the maximum number of edges in a graph with ν vertices and girth at least n + 1. In this paper we have obtained bounds on this function for n ∈ {5, 6, 7} and, in several cases, even the exact value. We have also developed a greedy algorithm for generating graphs with large size for given order and girth. |
|---|