Coverings by few monochromatic pieces - a transition between two Ramsey problems

András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow

Type: Preprint

Publication Date: 2013-04-03

Citations: 2

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	Coverings by few monochromatic pieces - a transition between two Ramsey problems	2013	András Gyárfás Gábor N. Sárközy Stanley M. Selkow
+ PDF Chat	Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems	2013	András Gyárfás Gábor N. Sárközy Stanley M. Selkow
+ PDF Chat	Large Monochromatic Components in Almost Complete Graphs and Bipartite Graphs	2021	Zoltán Füredi Ruth Luo
+ PDF Chat	Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs	2019	Louis DeBiasio András Gyárfás Robert A. Krueger Miklós Ruszinkó Gábor N. Sárközy
+	Large monochromatic components in almost complete graphs and bipartite graphs	2020	Zoltán Füredi Ruth Luo
+	Covering complete graphs by monochromatically bounded sets	2017	Luka Milićević
+	Covering complete graphs by monochromatically bounded sets	2017	Luka Milićević
+	Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs	2018	Louis DeBiasio András Gyárfás Robert A. Krueger Miklós Ruszinkó Gábor N. Sárközy
+	Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs.	2018	Louis DeBiasio András Gyárfás Robert A. Krueger Miklós Ruszinkó Gábor N. Sárközy
+	Tiling with monochromatic bipartite graphs of bounded maximum degree	2021	António Girão Oliver Janzer
+	Vertex Covering with Monochromatic Pieces of few Colours	2018	Marlo Eugster Frank Mousset
+ PDF Chat	Covering complete graphs by monochromatically bounded sets	2018	Luka Milićević
+	Vertex Covering with Monochromatic Pieces of few Colours	2018	Marlo Eugster Frank Mousset
+ PDF Chat	Ramsey-nice families of graphs	2018	Ron Aharoni Noga Alon Michal Amir Penny Haxell Dan Hefetz Zilin Jiang Gal Kronenberg Alon Naor
+	Large stars with few colors	2012	Amir Khamseh G.R. Omidi
+	Triangle Ramsey numbers of complete graphs	2023	Jacob Fox Jonathan Tidor Shengtong Zhang
+	Some problems in Graph Ramsey Theory	2015	Andrey Grinshpun
+	An additive version of Ramsey's theorem	2012	Andy Parrish
+	An additive version of Ramsey's theorem	2012	Andy Parrish
+ PDF Chat	Long monochromatic paths and cycles in 2-edge-colored multipartite graphs	2020	József Balogh Alexandr Kostochka M. I. Lavrov Xujun Liu

Works That Cite This (3)

Action	Title	Year	Authors
+ PDF Chat	Large 2-Coloured Matchings in 3-Coloured Complete Hypergraphs	2012	Tamás Terpai
+ PDF Chat	On $(t-1)$-colored paths in $t$-colored complete graphs	2018	Amir Khamseh
+	Problems and memories	2013	András Gyárfás

Works Cited by This (14)

Action	Title	Year	Authors
+ PDF Chat	The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs	2008	András Gyárfás Gábor N. Sárközy Endre Szemerédi
+	Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture	2009	Stéphane Bessy Stéphan Thomassé
+	Vertex coverings by monochromatic paths and cycles	1983	András Gyárfás
+ PDF Chat	Generalized Ramsey numbers for paths in<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="$2$"><mml:mn>2</mml:mn></mml:math>-chromatic graphs	1985	R. Meenakshi P. S. Sundararaghavan
+	The Ramsey number for a triple of long even cycles	2006	Agnieszka Figaj Tomasz Łuczak
+	A generalization of Ramsey theory for graphs	1978	Kai-Min Chung C.L. Liu
+ PDF Chat	The Ramsey number for stripes	1975	E. J. Cockayne Peter Lorimer
+ PDF Chat	Three-color Ramsey numbers for paths	2008	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi
+	Partitioning edge-coloured complete graphs into monochromatic cycles and paths	2014	Alexey Pokrovskiy
+	Vertex coverings by monochromatic cycles and trees	1991	Péter L. Erdős András Gyárfás L. Pyber