A variant of the classical Ramsey problem

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

Type: Article

Publication Date: 1997-12-01

Citations: 91

DOI: https://doi.org/10.1007/bf01195000

View Publication

Locations

COMBINATORICA - View

Similar Works

Action	Title	Year	Authors
+	A generalized Ramsey problem	2000	Maria Axenovich
+	Two Ramsey-related Problems	2019	Jingmei Zhang
+	On a Generalized Anti-Ramsey Problem	2001	Maria Axenovich André Kündgen
+	A New Lower Bound For A Ramsey-Type Problem	2005	Benny Sudakov
+	A Survey of Ramsey Theory	2001	Michele Bilton
+	An Explicit Construction for a Ramsey Problem	2004	Dhruv Mubayi
+	Ramsey's Problem	2010
+ PDF Chat	The Ramsey-type version of a problem of Pomerance and Schinzel	2012	Péter Pál Pach
+	Ramsey theory and its application	2014	Min Zhao
+ PDF Chat	An Introduction to Ramsey Theory	2018	Matthew Katz Jan Reimann
+	NOTE New Upper Bounds for a Canonical Ramsey Problem	2000	Tao Jiang Dhruv Mubayi
+	A new class of Ramsey–Turán problems	2010	H. Li Vladimir Nikiforov R. H. Schelp
+	On a generalization of Ramsey theory	1982	Michael S. Jacobson
+	Note on a Ramsey-Turán type problem	1985	Vojtěch Rödl
+	A Randomized Version of Ramseyʼs Theorem	2011	Luca Gugelmann Yury Person Angelika Steger Henning Thomas
+	The Ramsey game	2018	John McCleary
+	An application to discrete Ramsey theory	2023	Ben Krause
+	The Happy Ending Problem and its connection to Ramsey theory	2019	Sara Freyland
+	A Ramsey-Sperner theorem	1985	Zoltán Füredi
+ PDF Chat	On a Ramsey-Turán type problem	1976	Béla Bollobás P. Erdős

Works That Cite This (80)

Action	Title	Year	Authors
+ PDF Chat	A Survey of Hypergraph Ramsey Problems	2020	Dhruv Mubayi Andrew Suk
+	Distinct distances in planar point sets with forbidden 4-point patterns	2020	Adrian Dumitrescu
+ PDF Chat	Lower bounds on the Erdős–Gyárfás problem via color energy graphs	2023	József Balogh Sean English Emily Heath Robert A. Krueger
+	The Erdős-Gyárfás function <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mn>4</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo linebreak="goodbreak" linebreakstyle="after">=</mml:mo><mml:mfrac><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mrow><mml:mn>6</mml:mn></mml:mrow></mml:mfrac><mml:mi>n</mml:mi><mml:mo linebreak="goodbreak" …	2024	Patrick Bennett Ryan Cushman Andrzej Dudek Paweł Prałat
+	An application of the regularity lemma in generalized Ramsey theory	2003	Gábor N. Sárközy Stanley M. Selkow
+ PDF Chat	When is an Almost Monochromatic<i>K</i><sub>4</sub>Guaranteed?	2008	Alexandr Kostochka Dhruv Mubayi
+ PDF Chat	The Sub-Exponential Transition for the Chromatic Generalized Ramsey Numbers	2018	Choongbum Lee Brandon Tran
+ PDF Chat	New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers	2022	Alex Cameron Emily Heath
+ PDF Chat	New bounds on the generalized Ramsey number f(n,5,8)	2024	Enrique Gomez-Leos Emily Heath Alex Parker Coy Schwieder Shira Zerbib
+	An explicit edge-coloring of K_n with six colors on every K_5	2017	Alex Cameron

Works Cited by This (3)

Action	Title	Year	Authors
+	Extremal problems in graph theory	1997	Christopher M. Hartman
+	Linear Sets with Five Distinct Differences among Any Four Elements	1995	András Gyárfás Jenö Lehel
+	On coloring graphs to maximize the proportion of multicolored k-edges	1968	Paul Erdős Daniel J. Kleitman