Sciweavers

7 search results - page 1 / 2
» On Rado's Boundedness Conjecture
Sort
View
JCT
2006
82views more  JCT 2006»
13 years 4 months ago
On Rado's Boundedness Conjecture
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 the...
Jacob Fox, Daniel J. Kleitman
JCT
2010
113views more  JCT 2010»
13 years 3 months ago
Equations resolving a conjecture of Rado on partition regularity
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
Boris Alexeev, Jacob Tsimerman
CCCG
2007
13 years 6 months ago
A Lower Bound on the Area of a 3-Coloured Disc Packing
Given a set of unit-discs in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs? Rado conjectured
Peter Brass, Ferran Hurtado, Benjamin J. Lafrenier...
ALGORITHMICA
2010
156views more  ALGORITHMICA 2010»
13 years 4 months ago
On Covering Problems of Rado
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
RSA
2010
89views more  RSA 2010»
13 years 3 months ago
Ramsey properties of random discrete structures
We study thresholds for Ramsey properties of random discrete structures. In particular, we determine the threshold for Rado’s theorem for solutions of partition regular systems o...
Ehud Friedgut, Vojtech Rödl, Mathias Schacht