Large monochromatic components in edge colored graphs with a minimum degree condition
From MaRDI portal
Publication:2401439
zbMath1369.05076MaRDI QIDQ2401439
Gábor N. Sárközy, András Gyárfás
Publication date: 8 September 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p54
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (7)
On Schelp's problem for three odd long cycles ⋮ Large monochromatic components in colorings of complete hypergraphs ⋮ Large monochromatic components in hypergraphs with large minimum codegree ⋮ On Connected Components with Many Edges ⋮ Monochromatic components in edge-coloured graphs with large minimum degree ⋮ Large monochromatic components in almost complete graphs and bipartite graphs ⋮ Large monochromatic components in 3-colored non-complete graphs
Cites Work
- Unnamed Item
- Monochromatic cycle partitions of graphs with large minimum degree
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles
- Partitioning random graphs into monochromatic components
- Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles
- Monochromatic Cycles in 2-Coloured Graphs
- Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
- Large Monochromatic Components in Edge Colorings of Graphs: A Survey
- Monochromatic cycle partitions of edge-colored graphs
- An algorithmic version of the blow-up lemma
- The Monochromatic Circumference of 2‐Edge‐Colored Graphs
- On some Multicolor Ramsey Properties of Random Graphs
This page was built for publication: Large monochromatic components in edge colored graphs with a minimum degree condition
