When is an Almost MonochromaticK4Guaranteed?

DOI10.1017/S0963548308009413zbMath1180.05071MaRDI QIDQ3608338

Dhruv Mubayi, Alexandr V. Kostochka

Publication date: 4 March 2009

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

classical Ramsey numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (4)

The Erdős-Gyárfás problem on generalized Ramsey numbers ⋮ The Schur-Erdős problem for semi-algebraic colorings ⋮ Unnamed Item ⋮ Coloring Triple Systems with Local Conditions

Cites Work

• An explicit construction for a Ramsey problem
• A variant of the classical Ramsey problem
• Edge-coloring cliques with three colors on all 4-cliques
• A few remarks on Ramsey--Turán-type problems
• On graphs with small Ramsey numbers*
• An application of the regularity lemma in generalized Ramsey theory
• Edge-coloring cliques with many colors on subcliques

This page was built for publication: When is an Almost MonochromaticK₄Guaranteed?