On lengths of rainbow cycles

From MaRDI portal
(Redirected from Publication:870025)



Abstract: We prove several results regarding edge-colored complete graphs and rainbow cycles, cycles with no color appearing on more than one edge. We settle a question posed by Ball, Pultr, and Vojtv{e}chovsk'{y} by showing that if such a coloring does not contain a rainbow cycle of length n, where n is odd, then it also does not contain a rainbow cycle of length m for all m greater than 2n2. In addition, we present two examples which demonstrate that this result does not hold for even n. Finally, we state several open problems in the area.


Summary: We prove several results regarding edge-colored complete graphs and rainbow cycles, cycles with no color appearing on more than one edge. We settle a question posed by Ball, Pultr and Vojtěchovský by showing that if such a coloring does not contain a rainbow cycle of length \(n\), where \(n\) is odd, then it also does not contain a rainbow cycle of length \(m\) for all \(m\) greater than \(2n^2\). In addition, we present two examples which demonstrate that a similar result does not hold for even \(n\). Finally, we state several open problems in the area.











This page was built for publication: On lengths of rainbow cycles

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