Extremal graphs without three-cycles or four-cycles
Journal of Graph Theory
Calculating the extremal number ex(v;{C3,C4,...,Cn})
Discrete Applied Mathematics
New families of graphs without short cycles and large size
Discrete Applied Mathematics
Girth of {C3,...,Cs} -free extremal graphs
Discrete Applied Mathematics
Breaking symmetries in graph representation
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.04 |
For integers n=4 and @n=n+1, let ex(@n;{C"3,C"4,...,C"n}) denote the maximum number of edges in a graph with @n 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.