Generalizing the Ramsey problem through diameter

zbMath1016.05055MaRDI QIDQ1856336

Dhruv Mubayi

Publication date: 13 May 2003

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/122756

zbMATH Keywords

diametercomplete graphgeneralised Ramsey numberbiaprtite graph

Mathematics Subject Classification ID

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

Related Items (14)

Improved monochromatic double stars in edge colorings ⋮ Generalizations and strengthenings of Ryser's conjecture ⋮ Large components in r-edge-colorings of Kn have diameter at most five ⋮ Large monochromatic components and long monochromatic cycles in random hypergraphs ⋮ Large Monochromatic Triple Stars in Edge Colourings ⋮ Long monochromatic paths and cycles in 2-colored bipartite graphs ⋮ Large monochromatic components of small diameter ⋮ Monochromatic partitions in local edge colorings ⋮ Monochromatic diameter-2 components in edge colorings of the complete graph ⋮ Partitioning random graphs into monochromatic components ⋮ Ramsey-type results for Gallai colorings ⋮ Size of monochromatic double stars in edge colorings ⋮ Large monochromatic components in 3-colored non-complete graphs ⋮ The Erdős-Hajnal conjecture for three colors and triangles

This page was built for publication: Generalizing the Ramsey problem through diameter