Large monochromatic components in 3-colored non-complete graphs

JOURNAL OF COMBINATORIAL THEORY SERIES A

卷:175

Article

Rahimi, Zahra¹ 

[1] Inst Res Fundamental Sci IPM, Sch Math, POB 19395-5746, Tehran, Iran

关键词: 3-Coloring;    Monochromatic components;    Minimum degree;   

DOI  :  10.1016/j.jcta.2020.105256

来源: Elsevier

【 摘 要 】

We show that in every 3-coloring of the edges of a graph G of order N such that delta(G) >= 5N/6 - 1, there is a monochromatic component of order at least N/2. We also show that this result is best possible. (C) 2020 Elsevier Inc. All rights reserved.

【 授权许可】

Free