A note on graphs without short even cycles

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We show that any n-vertex graph without even cycles of length at most 2k has at most 1/2(n^{1 + 1/k}) + O(n) edges, and polarity graphs of generalized polygons show that this is asymptotically tight when k = 2,3,5.
6 pages

Keywords

Combinatorics, 05C35; 05C38

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/74691

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0503623
 http://arxiv.org/abs/math/0503623

Collections

arXiv