On lengths of rainbow cycles (Q870025)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5132818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On lengths of rainbow cycles |
scientific article; zbMATH DE number 5132818 |
Statements
On lengths of rainbow cycles (English)
0 references
12 March 2007
0 references
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.
0 references
0.8620839715003967
0 references
0.8594577312469482
0 references
0.85416579246521
0 references
0.8514686822891235
0 references
0.8481965065002441
0 references
