On even rainbow or nontriangular directed cycles

  title={On even rainbow or nontriangular directed cycles},
  author={Andrzej Czygrinow and Theodore Molla and Brendan Nagle and Roy Oursler},
  journal={Journal of Combinatorics},
Let $G = (V, E)$ be an $n$-vertex edge-colored graph. In 2013, H. Li proved that if every vertex $v \in V$ 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 $C_{\ell}$: if every vertex $v \in V$ is incident to at least $(n+5)/3$ distinctly colored edges, where $n \geq n_0(\ell)$ is sufficiently large, then $G$ admits an even rainbow $\ell$-cycle $C_{\ell}$. This result is best… 

Figures from this paper

Degree conditions forcing directed cycles
Caccetta-Häggkvist conjecture is a longstanding open problem on degree conditions that force an oriented graph to contain a directed cycle of a bounded length. Motivated by this conjecture, Kelly,


Rainbow Turán Problems
The rainbow Turán problem for even cycles is studied, and the bound $\ex^*(n,C_6) = O(n^{4/3})$, which is of the correct order of magnitude, is proved.
Rainbow C3's and c4's in edge-colored graphs
  • Hao Li
  • Mathematics
    Discret. Math.
  • 2013
On short cycles in triangle-free oriented graphs
An orientation of a simple graph is referred to as an oriented graph. Caccetta and Häggkvist conjectured that any digraph on n vertices with minimum outdegree d contains a directed cycle of length at
Rainbow structures in locally bounded colorings of graphs
We study approximate decompositions of edge‐colored quasirandom graphs into rainbow spanning structures: an edge‐coloring of a graph is locally ℓ‐bounded if every vertex is incident to at most ℓ
Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different colours. In 1980 Hahn conjectured that every properly edge-coloured complete graph Kn has a rainbow
Cycles of given length in oriented graphs
Testing subgraphs in directed graphs
A directed version of Szemeredi's regularity lemma is proved, which implies that for every H there is a one-sided error property tester whose query complexity is bounded by a function of ε only for testing the property PH of being H-free.