Large Monochromatic Components in Edge Colorings of Graphs: A Survey
From MaRDI portal
Publication:3064179
DOI10.1007/978-0-8176-8092-3_5zbMath1221.05140MaRDI QIDQ3064179
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
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C15: Coloring of graphs and hypergraphs
Related Items
Covering complete graphs by monochromatically bounded sets, Large monochromatic components of small diameter, Ramsey numbers of trails and circuits, On Connected Components with Many Edges, Coverings by few monochromatic pieces: a transition between two Ramsey problems, Partitioning random graphs into monochromatic components, Highly connected monochromatic subgraphs of two-colored complete graphs, 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, Generalizations and strengthenings of Ryser's conjecture, Ramsey numbers of path-matchings, covering designs, and 1-cores, Monochromatic components in edge-coloured graphs with large minimum degree, Monochromatic diameter-2 components in edge colorings of the complete graph, Large monochromatic components in edge colored graphs with a minimum degree condition, Discrepancies of spanning trees and Hamilton cycles, Complete edge-colored permutation graphs, Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth
