On even rainbow or nontriangular directed cycles
From MaRDI portal
Publication:2073645
Abstract: Let be an -vertex edge-colored graph. In 2013, H. Li proved that if every vertex is incident to at least distinctly colored edges, then admits a rainbow triangle. We establish a corresponding result for fixed even rainbow -cycles : if every vertex is incident to at least distinctly colored edges, where is sufficiently large, then admits an even rainbow -cycle . This result is best possible whenever (mod 3). Correspondingly, we also show that for a fixed (even or odd) integer , every large -vertex oriented graph with minimum outdegree at least admits a (consistently) directed -cycle . 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.
Recommendations
Cited in
(3)
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)