Name
Abstract | ||
|---|---|---|
We prove that Rado's Boundedness Conjecture from Richard Rado's 1933 famous dissertation Studien zur Kombinatorik is true if it is true for homogeneous equations. We then prove the first nontrivial case of Rado's Boundedness Conjecture: if a1, a2, and a3 are integers, and if for every 24-coloring of the positive integers (or even the nonzero rational numbers) there is a monochromatic solution to the equation a1x1 + a2x2 + a3x3=0, then for every finite coloring of the positive integers there is a monochromatic solution to a1x1 + a2x2 + a3x3=0. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.jcta.2005.07.004 | J. Comb. Theory, Ser. A |
Keywords | Field | DocType |
nonzero rational number,boundedness conjecture,rado,nontrivial case,rado's boundedness conjecture,finite coloring,homogeneous equation,partition regularity,monochromatic solution,positive integer,richard rado,rational number | Integer,Discrete mathematics,Monochromatic color,Combinatorics,Rational number,Homogeneous,Partition regularity,Rado graph,Rado's theorem,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
113 | 1 | Journal of Combinatorial Theory, Series A |
Citations | PageRank | References |
4 | 0.82 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jacob Fox | 1 | 25 | 2.83 |
| Daniel J. Kleitman | 2 | 854 | 277.98 |