A variant of the classical Ramsey problem

DOI10.1007/BF01195000zbMath0910.05034OpenAlexW1994434808MaRDI QIDQ1280270

András Gyárfás, Paul Erdős

Publication date: 14 March 1999

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

extremal graph theoryprobabilistic methods

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers ⋮ Polychromatic colorings of 1-regular and 2-regular subgraphs of complete graphs ⋮ A (5,5)-Colouring of K_n with Few Colours ⋮ On colorful edge triples in edge-colored complete graphs ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ 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 ⋮ A construction for difference sets with local properties ⋮ Proper edge colorings of Cartesian products with rainbow \(C_4\)-s ⋮ Edge colorings avoiding patterns ⋮ The Schur-Erdős problem for semi-algebraic colorings ⋮ Color Isomorphic Even Cycles and a Related Ramsey Problem ⋮ Edge-colorings avoiding rainbow and monochromatic subgraphs ⋮ Unnamed Item ⋮ More distinct distances under local conditions ⋮ When is an Almost MonochromaticK₄Guaranteed? ⋮ Coloring Triple Systems with Local Conditions ⋮ An application of the regularity lemma in generalized Ramsey theory ⋮ Local Properties via Color Energy Graphs and Forbidden Configurations ⋮ Generalized Ramsey numbers: forbidding paths with few colors ⋮ Distinct distances in planar point sets with forbidden 4-point patterns ⋮ An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\) ⋮ On generalized Ramsey theory: The bipartite case ⋮ A new bound for the Brown-Erdős-Sós problem ⋮ Graphs with 4-rainbow index 3 and \(n-1\) ⋮ Progress on local properties problems of difference sets

Cites Work

• Linear sets with five distinct differences among any four elements
• On the existence of triangulated spheres in 3-graphs, and related problems
• On coloring graphs to maximize the proportion of multicolored k-edges