Large Monochromatic Components in Edge Colorings of Graphs: A Survey

DOI10.1007/978-0-8176-8092-3_5zbMath1221.05140OpenAlexW78420916MaRDI QIDQ3064179

András Gyárfás

Publication date: 20 December 2010

Published in: Ramsey Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-8176-8092-3_5

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15)

Related Items (19)

Generalizations and strengthenings of Ryser's conjecture ⋮ Large monochromatic components in edge colored graphs with a minimum degree condition ⋮ Discrepancies of spanning trees and Hamilton cycles ⋮ Complete edge-colored permutation graphs ⋮ Large monochromatic components of small diameter ⋮ Ramsey numbers of trails and circuits ⋮ On Connected Components with Many Edges ⋮ Monochromatic spanning trees and matchings in ordered complete graphs ⋮ Highly connected monochromatic subgraphs of two-colored complete graphs ⋮ Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth ⋮ Ramsey numbers of path-matchings, covering designs, and 1-cores ⋮ Monochromatic components in edge-coloured graphs with large minimum degree ⋮ Coverings by few monochromatic pieces: a transition between two Ramsey problems ⋮ Monochromatic diameter-2 components in edge colorings of the complete graph ⋮ Partitioning random graphs into monochromatic components ⋮ Gallai colorings of non-complete graphs ⋮ On zero-sum spanning trees and zero-sum connectivity ⋮ New lower bounds on the size-Ramsey number of a path ⋮ Covering complete graphs by monochromatically bounded sets

This page was built for publication: Large Monochromatic Components in Edge Colorings of Graphs: A Survey