Monochromatic components in edge-coloured graphs with large minimum degree

DOI10.37236/9039zbMath1456.05063arXiv1909.09178OpenAlexW3119142443MaRDI QIDQ2223462

Hannah Guggiari, Alexander D. Scott

Publication date: 29 January 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.09178

zbMATH Keywords

Gyárfás-Sárközy conjecturelargest monochromatic component

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Vertex degrees (05C07)

Related Items (2)

Large monochromatic components in hypergraphs with large minimum codegree ⋮ Large monochromatic components in almost complete graphs and bipartite graphs

Cites Work

• Large monochromatic components in 3-colored non-complete graphs
• Long monochromatic paths and cycles in 2-colored bipartite graphs
• Large monochromatic components in edge colored graphs with a minimum degree condition
• Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
• Large Monochromatic Components in Edge Colorings of Graphs: A Survey
• Large monochromatic components in multicolored bipartite graphs

This page was built for publication: Monochromatic components in edge-coloured graphs with large minimum degree