An application of the regularity lemma in generalized Ramsey theory

DOI10.1002/jgt.10129zbMath1031.05087OpenAlexW2604113582WikidataQ124851011 ScholiaQ124851011MaRDI QIDQ4434547

Gábor N. Sárközy, Stanley M. Selkow

Publication date: 10 November 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10129

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (7)

The Erdős-Gyárfás problem on generalized Ramsey numbers ⋮ Rainbow subgraphs in edge-colored planar and outerplanar graphs ⋮ 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 ⋮ When is an Almost MonochromaticK₄Guaranteed? ⋮ Generalized Ramsey numbers: forbidding paths with few colors ⋮ A new bound for the Brown-Erdős-Sós problem

Cites Work

• A variant of the classical Ramsey problem
• Edge-coloring cliques with three colors on all 4-cliques
• A generalized Ramsey problem
• On edge colorings with at least \(q\) colors in every subset of \(p\) vertices
• On generalized Ramsey theory: The bipartite case
• Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings
• On the existence of triangulated spheres in 3-graphs, and related problems
• On coloring graphs to maximize the proportion of multicolored k-edges
• Edge-coloring cliques with many colors on subcliques

This page was built for publication: An application of the regularity lemma in generalized Ramsey theory