The Erdős-Gyárfás problem on generalized Ramsey numbers
From MaRDI portal
Publication:2940075
DOI10.1112/plms/pdu049zbMath1306.05148arXiv1403.0250OpenAlexW2079576387MaRDI QIDQ2940075
Jacob Fox, David Conlon, Choongbum Lee, Benjamin Sudakov
Publication date: 26 January 2015
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.0250
Related Items (14)
New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers ⋮ A (5,5)-Colouring of Kn with Few Colours ⋮ 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 ⋮ Graph-codes ⋮ 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 ⋮ Local Properties via Color Energy Graphs and Forbidden Configurations ⋮ Generalized Ramsey numbers: forbidding paths with few colors ⋮ An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\) ⋮ Progress on local properties problems of difference sets
Cites Work
- A variant of the classical Ramsey problem
- Edge-coloring cliques with three colors on all 4-cliques
- On edge colorings with at least \(q\) colors in every subset of \(p\) vertices
- Ramsey theory applications
- On the Grid Ramsey Problem and Related Questions: Fig. 1.
- When is an Almost MonochromaticK4Guaranteed?
- An application of the regularity lemma in generalized Ramsey theory
- Ramsey-Type Problem for an Almost Monochromatic $K_4$
- Edge-coloring cliques with many colors on subcliques
- I. Schur, C. E. Shannon and Ramsey numbers, a short story
This page was built for publication: The Erdős-Gyárfás problem on generalized Ramsey numbers
