Monochromatic diameter-2 components in edge colorings of the complete graph
DOI10.2140/INVOLVE.2021.14.377zbMATH Open1479.05120OpenAlexW3184315876MaRDI QIDQ2233352FDOQ2233352
Authors: Miklós Ruszinkó, Lang Song, Daniel P. Szabo 
Publication date: 18 October 2021
Published in: Involve (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/involve.2021.14.377
Recommendations
- Large components in \(r\)-edge-colorings of \(K_n\) have diameter at most five
- Large monochromatic components of small diameter
- Finding large \(p\)-colored diameter two subgraphs
- Size of monochromatic double stars in edge colorings
- Exact values of multicolor Ramsey numbers \(R_l(C_{\le l+1})\)
- scientific article; zbMATH DE number 3851127
- Generalizing the Ramsey problem through diameter
- scientific article
- Covering complete graphs by monochromatically bounded sets
- Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs
Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Generalizing the Ramsey problem through diameter
- Large monochromatic components in edge colorings of graphs: A survey
- Finding large \(p\)-colored diameter two subgraphs
- Covering the complete graph by partitions
- Large components in \(r\)-edge-colorings of \(K_n\) have diameter at most five
- Large Monochromatic Triple Stars in Edge Colourings
Cited In (5)
This page was built for publication: Monochromatic diameter-2 components in edge colorings of the complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233352)
