Monochromatic diameter-2 components in edge colorings of the complete graph
From MaRDI portal
Publication:2233352
DOI10.2140/involve.2021.14.377zbMath1479.05120OpenAlexW3184315876MaRDI QIDQ2233352
Miklós Ruszinkó, Daniel P. Szabo, Lang Song
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
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Graph designs and isomorphic decomposition (05C51)
Related Items (1)
Cites Work
- Covering the complete graph by partitions
- Finding large \(p\)-colored diameter two subgraphs
- Generalizing the Ramsey problem through diameter
- Large components in r-edge-colorings of Kn have diameter at most five
- Large Monochromatic Components in Edge Colorings of Graphs: A Survey
- Large Monochromatic Triple Stars in Edge Colourings
This page was built for publication: Monochromatic diameter-2 components in edge colorings of the complete graph