A note on graphs without short even cycles

Simple item page
dc.creatorLam, Thomas
dc.creatorVerstraete, Jacques
dc.date2005-03-28
dc.date.accessioned2026-07-07T05:18:32Z
dc.date.available2026-07-07T05:18:32Z
dc.descriptionWe 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.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/math/0503623
dc.identifierhttp://arxiv.org/abs/math/0503623
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74691
dc.subjectCombinatorics
dc.subject05C35; 05C38
dc.titleA note on graphs without short even cycles
dc.typetext

Files

Collections

arXiv