Linear cycles of consecutive lengths
arXiv:2006.13206
Abstract
A well-known result of Verstraëte \cite{V00} shows that for each integer every graph with average degree at least contains cycles of consecutive even lengths, the shortest of which is at most twice the radius of . We establish two extensions of Verstraëte's result for linear cycles in linear -uniform hypergraphs. We show that for any fixed integers , there exist constants and , such that every linear -uniform hypergraph with average degree contains linear cycles of consecutive even lengths, the shortest of which is at most . In particular, as an immediate corollary, we retrieve the current best known upper bound on the linear Turán number of with improved coefficients. Furthermore, we show that for any fixed integers , there exist constants and such that every -vertex linear -uniform graph with average degree , contains linear cycles of consecutive lengths, the shortest of which has length at most . Both the degree condition and the shortest length among the cycles guaranteed are best possible up to a constant factor.