Explore >> Select a destination
|
You are here 
|
xenaproject.wordpress.com | ||
| | | | |
terrytao.wordpress.com
|
|
| | | | | I have uploaded to the arXiv my paper "New Nikodym set constructions over finite fields". This is a spinoff of my previous project with Bogdan Georgiev, Javier Gómez-Serran... | |
| | | | |
anuragbishnoi.wordpress.com
|
|
| | | | | The Ramsey number $latex R(s, t)$ is the smallest $latex n$ such that every graph on $latex \geq n$ vertices either contains a clique of size $latex s$ or an independent set of size $latex t$. Ramsey's theorem implies that these numbers always exist, and determining them (precisely or asymptotically) has been a major challenge... | |
| | | | |
yufeizhao.wordpress.com
|
|
| | | | | Ashwin Sah Ashwin Sah just proved a new upper bound to diagonal Ramsey numbers. See his preprint on the arXiv. This is the first improvement since Conlon's upper bound published in Annals of Math in 2009, which in turn built on earlier work of Thomason (1988). Obtaining asymptotics of Ramsey numbers is perhaps the central... | |
| | | | |
textilinslag.wordpress.com
|
|
| | | Welcome to WordPress.com. This is your first post. Edit or delete it and start blogging! | ||
