Premium
The Monochromatic Circumference of 2‐Edge‐Colored Graphs
Author(s) -
White Matthew
Publication year - 2017
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22052
Subject(s) - monochromatic color , mathematics , combinatorics , colored , graph , circumference , enhanced data rates for gsm evolution , discrete mathematics , geometry , optics , computer science , physics , telecommunications , materials science , composite material
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 c | V ( G ) | could be. In this article, an answer is given for all c ∈ ( 0 , 1 ) to an asymptotic form of their question.