Toward a Graph Version of Rado's Theorem

Andy Parrish

Type: Article

Publication Date: 2013-03-01

Citations: 0

DOI: https://doi.org/10.37236/3082

Abstract

An equation is called graph-regular if it always has monochromatic solutions under edge-colorings of $K_{\mathbb{N}}$. We present two Rado-like conditions which are respectively necessary and sufficient for an equation to be graph-regular.

Locations

The Electronic Journal of Combinatorics - View - PDF
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Toward a graph version of Rado's theorem	2012	Andy Parrish
+	Toward a graph version of Rado's theorem	2012	Andy Parrish
+	Adventures in Graph Ramsey Theory	2013	Andrew T. Parrish
+	Equations resolving a conjecture of Rado on partition regularity	2009	Boris V. Alexeev Jacob Tsimerman
+	Solution Regularity of k-partite Linear Systems -- A Variant of Rado's Theorem	2021	Hongyi Zhou
+	On Rado numbers for equations with unit fractions	2023	Collier Gaiser
+	Resolving a Conjecture on Degree of Regularity of Linear Homogeneous Equations	2014	Noah Golowich
+	Resolving a Conjecture on Degree of Regularity of Linear Homogeneous Equations	2014	Noah Golowich
+ PDF Chat	Resolving a Conjecture on Degree of Regularity of Linear Homogeneous Equations	2014	Noah Golowich
+	An infinite color analogue of Rado's theorem	2007	Jacob Fox
+	Avoiding Monochromatic Solutions to 3-term Equations	2021	Kevin Costello Gabriel Elvin
+	Some multivariable Rado numbers	2022	Gang Yang Yaping Mao Changxiang He Zhao Wang
+	Generalised Rado and Roth criteria	2022	Jonathan Chapman Sam Chow
+	Towards a Version of Ohba’s Conjecture for Improper Colorings	2017	Wei Wang Jianguo Qian Zhidan Yan
+ PDF Chat	Element-Distinct Solution For Rado's Theorem	2024	Ningyuan Yang Tianyi Tao
+ PDF Chat	Homogeneous Patterns in Ramsey Theory	2025	Sukumar Das Adhikari Sayan Goswami
+	$2$-color Rado number for $x_1 +x_2 +\cdots +x_n=y_1 +y_2=z$	2020	Byeong Moon Kim Woonjae Hwang Byung Chul Song
+	Rational Coloring	2024	Alexander Soifer
+	COLORING SUBGRAPHS OF THE RADO GRAPH	2006	N. Sauer
+	On the finiteness of some <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml50" display="inline" overflow="scroll" altimg="si50.gif"><mml:mi>n</mml:mi></mml:math>-color Rado numbers	2016	Sukumar Das Adhikari L. Boza Shalom Eliahou J. M. MARIN M.P. Revuelta M.I. Sanz

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (5)

Action	Title	Year	Authors
+	Independent Finite Sums forKm-Free Graphs	1997	Walter Deuber David S. Gunderson Neil Hindman Dona Strauss
+	Independent Deuber sets in graphs on the natural numbers	2003	David S. Gunderson Imre Leader Hans Jürgen Prömel Vojtěch Rödl
+	Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers	2001	David S. Gunderson Imre Leader Hans Jürgen Prömel Vojtěch Rödl
+ PDF Chat	Studien zur Kombinatorik	1933	Richard Rado
+ PDF Chat	An additive version of Ramsey’s theorem	2011	Andy Parrish