Ramsey-Type Problem for an Almost Monochromatic $K_4$

DOI10.1137/070706628zbMath1190.05085arXiv0710.5571OpenAlexW2030184488MaRDI QIDQ5189505

Jacob Fox, Benjamin Sudakov

Publication date: 17 March 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0710.5571

zbMATH Keywords

Ramsey numberedge coloringprobabilistic methodrandom methodRamsey-type

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (8)

The Erdős-Gyárfás problem on generalized Ramsey numbers ⋮ Gallai-Ramsey numbers involving a rainbow 4-path ⋮ The Erdős–Gyárfás function with respect to Gallai‐colorings ⋮ The Schur-Erdős problem for semi-algebraic colorings ⋮ Color Isomorphic Even Cycles and a Related Ramsey Problem ⋮ Unnamed Item ⋮ Coloring Triple Systems with Local Conditions ⋮ Dependent random choice

This page was built for publication: Ramsey-Type Problem for an Almost Monochromatic $K_4$