Tag Archives: Aubrey de Grey

Aubrey de Grey: The chromatic number of the plane is at least 5

Posted on April 10, 2018 by Gil Kalai

A major progress on an old standing beautiful problem. Aubrey de Grey proved that the chromatic number of the plane is at least 5. (I first heard about it from Alon Amit.) The Hadwiger–Nelson problem asks for the minimum number of … Continue reading →

Posted in Combinatorics, Geometry, Open problems, Updates | Tagged Aubrey de Grey, The Hadwiger–Nelson problem | 11 Comments

	vznvzn on Dan Romik on the Riemann zeta…
	Are Natural Mathemat… on An Invitation to a Conference:…
	Dan Romik on the Rie… on Dan Romik Studies the Riemann…
	Gil Kalai on Dan Romik Studies the Riemann…
	Matt Baker on Imre Bárány: Limit shape
	Itai Benjamini and J… on Hardness of Approximating Vert…
	Itai Benjamini and J… on Must-read book by Avi Wig…
	Gil Kalai on Hardness of Approximating Vert…
	Tools and Sensitivit… on Amazing: Hao Huang Proved the…
	La optimización de t… on A sensation in the morning new…
	Joseph Malkevitch on Imre Bárány: Limit shape
	Un matemático ruso d… on A sensation in the morning new…

Tag Archives: Aubrey de Grey

Aubrey de Grey: The chromatic number of the plane is at least 5

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives