Randomly perturbed digraphs with n-edge-colorings contain rainbow copies of all oriented cycles of all lengths simultaneously, with high probability.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Universality for rainbow oriented cycles in perturbed digraphs
Randomly perturbed digraphs with n-edge-colorings contain rainbow copies of all oriented cycles of all lengths simultaneously, with high probability.