Approximate Euclidean Ramsey theorems
According to a classical result of Szemerédi, every dense subset of 1,2,…,<em>N</em> contains an arbitrary long arithmetic progression, if <em>N</em> is large enough. Its analogue in higher dimensions due to Fürstenberg and Katznelson says that every dense subset of {1,2,…,&l...
Main Author: | Adrian Dumitrescu |
---|---|
Format: | Article |
Language: | English |
Published: |
Carleton University
2011-04-01
|
Series: | Journal of Computational Geometry |
Online Access: | http://jocg.org/index.php/jocg/article/view/38 |
Similar Items
-
Ramsey's Theorem
by: Riccardi Marco
Published: (2008-01-01) -
Using Ramsey’s theorem once
by: Hirst, J.L, et al.
Published: (2019) -
Two extensions of Ramsey's theorem
by: Conlon, David, et al.
Published: (2015) -
On a generalization of Ramsey's theorem
by: Mathias, A. R. D.
Published: (1969) -
A stochastic Ramsey theorem
by: Xu, Zibo
Published: (2010)