Edge-coloring cliques with three colors on all 4-cliques

DOI10.1007/PL00009822zbMath0910.05035OpenAlexW2091175510MaRDI QIDQ1280308

Dhruv Mubayi

Publication date: 14 March 1999

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009822

zbMATH Keywords

boundsRamsey theorycoloringgeneralized Ramsey

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (15)

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 ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ The Erdős-Gyárfás problem on generalized Ramsey numbers ⋮ Lower bounds on the Erdős–Gyárfás problem via color energy graphs ⋮ The Erdős–Gyárfás function with respect to Gallai‐colorings ⋮ Graph-codes ⋮ The Schur-Erdős problem for semi-algebraic colorings ⋮ Unnamed Item ⋮ When is an Almost MonochromaticK₄Guaranteed? ⋮ Coloring Triple Systems with Local Conditions ⋮ Dependent random choice ⋮ An application of the regularity lemma in generalized Ramsey theory ⋮ An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\) ⋮ On generalized Ramsey theory: The bipartite case

This page was built for publication: Edge-coloring cliques with three colors on all 4-cliques