Mathematical Hadwiger-Nelson problem solved....
- Thread starter Psychedelic_MackDaddy
- Start date
Very interesting story. The proof seems fairly simple. I wonder what sort of success that Aubrey de Grey has had in engineering a cure for aging.
---------------------
After decades of stalemate, someone has made a breakthrough with the “Hadwiger-Nelson problem”, a fiendishly difficult mathematical problem that has remained unanswered since 1950. Most incredibly of all, the person who figured it out isn’t strictly even a mathematician, he’s a British computer scientist-turned-biologist who spends most of his energy trying to engineer a "cure" for aging.
Aubrey de Grey has recently helped to solve this decade-old dilemma in a paper called “The Chromatic Number of the Plane is at least 5”. The study has not yet been independently peer-reviewed, but you can find a preprint of the paper at the following link:
https://arxiv.org/abs/1804.02385v2
The chromatic number of the plane is at least 5
Aubrey D.N.J. de Grey
(Submitted on 8 Apr 2018 (v1), last revised 11 Apr 2018 (this version, v2))
We present a family of finite unit-distance graphs in the plane that are not 4-colourable, thereby improving the lower bound of the Hadwiger-Nelson problem. The smallest such graph that we have so far discovered has 1581 vertices.
Subjects: Combinatorics (math.CO)
Cite as: arXiv:1804.02385 [math.CO]
(or arXiv:1804.02385v2 [math.CO] for this version)
Submission history
From: Aubrey de Grey [view email]
[v1] Sun, 8 Apr 2018 00:33:50 GMT (784kb,D)
[v2] Wed, 11 Apr 2018 15:27:23 GMT (773kb,D)
---------------------
After decades of stalemate, someone has made a breakthrough with the “Hadwiger-Nelson problem”, a fiendishly difficult mathematical problem that has remained unanswered since 1950. Most incredibly of all, the person who figured it out isn’t strictly even a mathematician, he’s a British computer scientist-turned-biologist who spends most of his energy trying to engineer a "cure" for aging.
Aubrey de Grey has recently helped to solve this decade-old dilemma in a paper called “The Chromatic Number of the Plane is at least 5”. The study has not yet been independently peer-reviewed, but you can find a preprint of the paper at the following link:
https://arxiv.org/abs/1804.02385v2
The chromatic number of the plane is at least 5
Aubrey D.N.J. de Grey
(Submitted on 8 Apr 2018 (v1), last revised 11 Apr 2018 (this version, v2))
We present a family of finite unit-distance graphs in the plane that are not 4-colourable, thereby improving the lower bound of the Hadwiger-Nelson problem. The smallest such graph that we have so far discovered has 1581 vertices.
Subjects: Combinatorics (math.CO)
Cite as: arXiv:1804.02385 [math.CO]
(or arXiv:1804.02385v2 [math.CO] for this version)
Submission history
From: Aubrey de Grey [view email]
[v1] Sun, 8 Apr 2018 00:33:50 GMT (784kb,D)
[v2] Wed, 11 Apr 2018 15:27:23 GMT (773kb,D)
If you had a choice what would you be - the best looking person, the strongest most athletic person, or the smartest person? Only one.
