Large components in r-edge-colorings of Kn have diameter at most five

DOI10.1002/jgt.20587zbMath1242.05175OpenAlexW1524433708MaRDI QIDQ2891044

Miklós Ruszinkó

Publication date: 13 June 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20587

zbMATH Keywords

\(r\)-edge-coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Generalized Ramsey theory (05C55)

Related Items (8)

Improved monochromatic double stars in edge colorings ⋮ Generalizations and strengthenings of Ryser's conjecture ⋮ Large Monochromatic Triple Stars in Edge Colourings ⋮ Large monochromatic components of small diameter ⋮ Large monochromatic components in colorings of complete hypergraphs ⋮ On Connected Components with Many Edges ⋮ Monochromatic diameter-2 components in edge colorings of the complete graph ⋮ Covering complete graphs by monochromatically bounded sets

Cites Work

• Covering the complete graph by partitions
• Size of monochromatic double stars in edge colorings
• Generalizing the Ramsey problem through diameter
• Unnamed Item

This page was built for publication: Large components in r-edge-colorings of Kn have diameter at most five