On even rainbow or nontriangular directed cycles

From MaRDI portal
Publication:2073645



Abstract: Let G=(V,E) be an n-vertex edge-colored graph. In 2013, H. Li proved that if every vertex vinV is incident to at least (n+1)/2 distinctly colored edges, then G admits a rainbow triangle. We establish a corresponding result for fixed even rainbow ell-cycles Cell: if every vertex vinV is incident to at least (n+5)/3 distinctly colored edges, where ngeqn0(ell) is sufficiently large, then G admits an even rainbow ell-cycle Cell. This result is best possible whenever ellotequiv0 (mod 3). Correspondingly, we also show that for a fixed (even or odd) integer ellgeq4, every large n-vertex oriented graph vecG=(V,vecE) with minimum outdegree at least (n+1)/3 admits a (consistently) directed ell-cycle vecCell. Our latter result relates to one of Kelly, K"uhn, and Osthus, who proved a similar statement for oriented graphs with large semi-degree. Our proofs are based on the stability method.












This page was built for publication: On even rainbow or nontriangular directed cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2073645)