|
|||||
|
|
The Monochromatic Circumference of 2‐Edge‐Colored Graphs |
|
| Authors: | Matthew White |
| Abstract: | Li et al. (Discrete Math 310 (2010), 3579–3583) asked how long the longest monochromatic cycle in a 2‐edge‐colored graph G with minimum degree at least  could be. In this article, an answer is given for all  to an asymptotic form of their question. |
| Keywords: | ramsey circumference monochromatic cycles |