AsOne
Problems
Log in
Sign up
Hadwiger-Nelson Problem
The Chromatic Number of the Plane (CNP) is the chromatic number of the graph whose vertices are elements of the plane, and two points are connected by an edge if they are a unit distance apart. The Hadwiger-Nelson problem asks to compute CNP.
Create post
Join
Filter
University of Calgary
McMaster University
University of Waterloo
Springer
COVID-19
Math
Computer Science
Physics
Biology
Chemistry
Peer Reviewed
Awaiting Review
Nature
Science
Annals of Mathematics
Physical Review A
Discussion
Research
Active
Inactive
Clear All
Filter
Hot
New
Top
2
Math
Peer Reviewed
The chromatic number of the plane is at least 5
(arxiv.org/abs/1804.02385)
Polymath Projects
· 1 year ago |
0 comments
2
Discussion
Active
Polymath proposal: finding simpler unit distance graphs of chromatic number 5
(polymathprojects.org/2018/04/1...)
Polymath Projects
· 1 year ago |
0 comments
1
Research
Active
Polymath16, seventeenth thread: Declaring victory
(dustingmixon.wordpress.com/202...)
Polymath Projects
· 1 year ago |
0 comments
1
Research
Inactive
Polymath16, sixteenth thread: Writing the paper and chasing down loose ends, II
(dustingmixon.wordpress.com/202...)
Polymath Projects
· 1 year ago |
0 comments
0
Research
Inactive
Polymath16, fifteenth thread: Writing the paper and chasing down loose ends
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
1 comment
0
Research
Inactive
Polymath16, fourteenth thread: Automated graph minimization?
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
0 comments
0
Research
Inactive
Polymath16, thirteenth thread: Bumping the deadline?
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
0 comments
0
Research
Inactive
Polymath16, twelfth thread: Year in review and future plans
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
0 comments
0
Research
Inactive
Polymath16, eleventh thread: Chromatic numbers of planar sets
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
0 comments
0
Research
Inactive
Polymath16, tenth thread: Open SAT instances
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
0 comments
0
Research
Inactive
Polymath16, ninth thread: Searching for a 6-coloring
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
0 comments
0
Research
Inactive
Polymath16, eighth thread: More upper bounds
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
0 comments
0
Research
Inactive
Polymath16, seventh thread: Upper bounds
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
0 comments
0
Research
Inactive
Polymath16, sixth thread: Wrestling with infinite graphs
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
0 comments
0
Research
Inactive
Polymath16, fifth thread: Human-verifiable proofs
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
0 comments
0
Research
Inactive
Polymath16, fourth thread: Applying the probabilistic method
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
0 comments
0
Research
Inactive
Polymath16, third thread: Is 6-chromatic within reach?
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
0 comments
0
Research
Inactive
Polymath16, second thread: What does it take to be 5-chromatic?
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
0 comments
0
Research
Inactive
Polymath16, first thread: Simplifying de Grey’s graph
(dustingmixon.wordpress.com/201...)
Polymath Projects
· 1 year ago |
0 comments
a/hadwiger-nelson
4 Members
Created Oct 08, 2020
Create post
Join
Open problems
Riemann Hypothesis
P versus NP
Collatz Conjecture
Goldbach's Conjecture
Twin Prime Conjecture
ABC Conjecture
Hadwiger-Nelson Problem
Kalai's 3^d Conjecture
View all open problems →
About
Contact
Polymath Wiki
Moderator Guidelines
Terms & Privacy
© AsOne 2020