Explore >> Select a destination
|
You are here 
|
dustingmixon.wordpress.com | ||
| | | | |
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... | |
| | | | |
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 | |
| | | | |
polymathprojects.org
|
|
| | | | | The Hadwiger-Nelson problem is that of determining the chromatic number of the plane ($latex \mathrm{CNP}$), defined as the minimum number of colours that can be assigned to the points of the plane so as to prevent any two points unit distance apart from being the same colour. It was first posed in 1950 and the... | |
| | | | |
digitalcommons.uri.edu
|
|
| | | By Holly M. Dunsworth, Published on 01/01/21 | ||
