### Abstract

It is well-known that in every k-coloring of the edges of the complete graph K_{n} there is a monochromatic connected component of order at least (formula presented)k-1. In this paper we study an extension of this problem by replacing complete graphs by graphs of large minimum degree. For k = 2 the authors proved that δ(G) ≥(formula presented) ensures a monochromatic connected component with at least δ(G) + 1 vertices in every 2-coloring of the edges of a graph G with n vertices. This result is sharp, thus for k = 2 we really need a complete graph to guarantee that one of the colors has a monochromatic connected spanning subgraph. Our main result here is that for larger values of k the situation is different, graphs of minimum degree (1 − ϵk)n can replace complete graphs and still there is a monochromatic connected component of order at least (formula presented), in fact (formula presented) suffices. Our second result is an improvement of this bound for k = 3. If the edges of G with δ(G) ≥ (formula presented) are 3-colored, then there is a monochromatic component of order at least n/2. We conjecture that this can be improved to 9 and for general k we (onjectu) the following: if k ≥ 3 and G is a graph of order n such that δ(G) ≥ (formula presented) n, then in any k-coloring of the edges of G there is a monochromatic connected component of order at least (formula presented).

Original language | English |
---|---|

Article number | #P3.54 |

Journal | Electronic Journal of Combinatorics |

Volume | 24 |

Issue number | 3 |

Publication status | Published - Sep 8 2017 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Computational Theory and Mathematics

### Cite this

*Electronic Journal of Combinatorics*,

*24*(3), [#P3.54].

**Large monochromatic components in edge colored graphs with a minimum degree condition.** / Gyárfás, A.; Sárközy, Gábor N.

Research output: Contribution to journal › Article

*Electronic Journal of Combinatorics*, vol. 24, no. 3, #P3.54.

}

TY - JOUR

T1 - Large monochromatic components in edge colored graphs with a minimum degree condition

AU - Gyárfás, A.

AU - Sárközy, Gábor N.

PY - 2017/9/8

Y1 - 2017/9/8

N2 - It is well-known that in every k-coloring of the edges of the complete graph Kn there is a monochromatic connected component of order at least (formula presented)k-1. In this paper we study an extension of this problem by replacing complete graphs by graphs of large minimum degree. For k = 2 the authors proved that δ(G) ≥(formula presented) ensures a monochromatic connected component with at least δ(G) + 1 vertices in every 2-coloring of the edges of a graph G with n vertices. This result is sharp, thus for k = 2 we really need a complete graph to guarantee that one of the colors has a monochromatic connected spanning subgraph. Our main result here is that for larger values of k the situation is different, graphs of minimum degree (1 − ϵk)n can replace complete graphs and still there is a monochromatic connected component of order at least (formula presented), in fact (formula presented) suffices. Our second result is an improvement of this bound for k = 3. If the edges of G with δ(G) ≥ (formula presented) are 3-colored, then there is a monochromatic component of order at least n/2. We conjecture that this can be improved to 9 and for general k we (onjectu) the following: if k ≥ 3 and G is a graph of order n such that δ(G) ≥ (formula presented) n, then in any k-coloring of the edges of G there is a monochromatic connected component of order at least (formula presented).

AB - It is well-known that in every k-coloring of the edges of the complete graph Kn there is a monochromatic connected component of order at least (formula presented)k-1. In this paper we study an extension of this problem by replacing complete graphs by graphs of large minimum degree. For k = 2 the authors proved that δ(G) ≥(formula presented) ensures a monochromatic connected component with at least δ(G) + 1 vertices in every 2-coloring of the edges of a graph G with n vertices. This result is sharp, thus for k = 2 we really need a complete graph to guarantee that one of the colors has a monochromatic connected spanning subgraph. Our main result here is that for larger values of k the situation is different, graphs of minimum degree (1 − ϵk)n can replace complete graphs and still there is a monochromatic connected component of order at least (formula presented), in fact (formula presented) suffices. Our second result is an improvement of this bound for k = 3. If the edges of G with δ(G) ≥ (formula presented) are 3-colored, then there is a monochromatic component of order at least n/2. We conjecture that this can be improved to 9 and for general k we (onjectu) the following: if k ≥ 3 and G is a graph of order n such that δ(G) ≥ (formula presented) n, then in any k-coloring of the edges of G there is a monochromatic connected component of order at least (formula presented).

UR - http://www.scopus.com/inward/record.url?scp=85029184187&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029184187&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85029184187

VL - 24

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

SN - 1077-8926

IS - 3

M1 - #P3.54

ER -