Large monochromatic components in 3-colored non-complete graphs

DOI10.1016/j.jcta.2020.105256zbMath1442.05067OpenAlexW3017992347MaRDI QIDQ778694

Zahra Rahimi

Publication date: 3 July 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2020.105256

zbMATH Keywords

minimum degree3-coloringmonochromatic components

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (3)

Large monochromatic components in hypergraphs with large minimum codegree ⋮ Monochromatic components in edge-coloured graphs with large minimum degree ⋮ Large monochromatic components in almost complete graphs and bipartite graphs

Cites Work

• Generalizing the Ramsey problem through diameter
• On Schelp's problem for three odd long cycles
• Large monochromatic components in edge colored graphs with a minimum degree condition
• Monochromatic Cycles in 2-Coloured Graphs
• Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
• Highly connected monochromatic subgraphs of multicolored graphs
• Large monochromatic components in multicolored bipartite graphs

This page was built for publication: Large monochromatic components in 3-colored non-complete graphs