Abstract
We show that in every 3-coloring of the edges of a graph G of order N such that δ(G)≥5N6−1, there is a monochromatic component of order at least N/2. We also show that this result is best possible.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have