Large monochromatic components in almost complete graphs and bipartite graphs

DOI10.37236/9824zbMath1466.05067arXiv2008.12217OpenAlexW3175170036MaRDI QIDQ2034067

Ruth Luo, Zoltan Fueredi

Publication date: 21 June 2021

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

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

zbMATH Keywords

\(t\)-edge-coloringstar-matching-matching Ramsey number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (1)

Large monochromatic components in hypergraphs with large minimum codegree

Cites Work

• Unnamed Item
• Large monochromatic components in 3-colored non-complete graphs
• Long monochromatic paths and cycles in 2-colored bipartite graphs
• Monochromatic components in edge-coloured graphs with large minimum degree
• 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 multicolored bipartite graphs
• Partitioning a graph into monochromatic connected subgraphs

This page was built for publication: Large monochromatic components in almost complete graphs and bipartite graphs