When is an Almost MonochromaticK4Guaranteed?

DOI10.1017/S0963548308009413MaRDI QIDQ3608338zbMATH OpenFDO

Authors Dhruv Mubayi, Alexandr Kostochka

Publication date 4 March 2009

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

Full work available at URL https://doi.org/10.1017/S0963548308009413

zbMATH Keywords

classical Ramsey numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Recommendations

• Ramsey-type problem for an almost monochromatic \(K_4\)
• Almost-rainbow edge-colorings of some small subgraphs
• On the Ramsey multiplicity of complete graphs
• Edge-coloring cliques with three colors on all 4-cliques
• Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs

Cites work

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

Cited in

(7)

• The Schur-Erdős problem for semi-algebraic colorings
• Bounds for two multicolor Ramsey numbers concerning quadrilaterals
• Coloring triple systems with local conditions
• The Erdős-Gyárfás problem on generalized Ramsey numbers
• Semi-algebraic colorings of complete graphs
• Ramsey-type problem for an almost monochromatic \(K_4\)
• A random coloring process gives improved bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608338)