/explore
|
You are here 
|
gilkalai.wordpress.com | ||
| | | | |
terrytao.wordpress.com
Building on the interest expressed in the comments to this previous post, I am now formally proposing to initiate a Polymath project on the topic of obtaining new upper bounds on the |
|
| | | | | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
gowers.wordpress.com
Although it was from only a couple of people, I had an enthusiastic response to a very tentative suggestion that it might be rewarding to see whether a polymath project could say anything useful about Frankl's union-closed conjecture. A potentially worrying aspect of the idea is that the problem is extremely elementary to state, does... |
|
| | | | | ||
| | | | |
futurism.com
This post was originally written by Manan Shah as a response to a question on Quora. |
|
| | | |||
