An explicit construction for a Ramsey problem

DOI10.1007/S00493-004-0019-6zbMath1058.05025OpenAlexW2072455759MaRDI QIDQ705745

Dhruv Mubayi

Publication date: 14 February 2005

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-004-0019-6

zbMATH Keywords

explicit constructionscoloringalgebraic methodRamsey problems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (8)

New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers ⋮ A (5,5)-Colouring of K_n with Few Colours ⋮ On colorful edge triples in edge-colored complete graphs ⋮ Lower bounds on the Erdős–Gyárfás problem via color energy graphs ⋮ Edge-colorings avoiding rainbow and monochromatic subgraphs ⋮ When is an Almost MonochromaticK₄Guaranteed? ⋮ Coloring Triple Systems with Local Conditions ⋮ An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\)

This page was built for publication: An explicit construction for a Ramsey problem