Recent Comments

Recent Posts
 The Logarithmic Minkowski Problem
 Face to face talks and recorded videotaped introductions
 Alef’s Corner: QED (two versions)
 Dream a Little Dream: Quantum Computer Poetry for the Skeptics (Part II, The Classics)
 Giving a talk at Eli and Ricky’s geometry seminar. (October 19, 2021)
 To cheer you up in difficult times 32, Annika Heckel’s guest post: How does the Chromatic Number of a Random Graph Vary?
 To Cheer You Up in Difficult Times 31: Federico Ardila’s Four Axioms for Cultivating Diversity
 Dream a Little Dream: Quantum Computer Poetry for the Skeptics (Part I, mainly 2019)
 To Cheer you up in difficult times 30: Irit Dinur, Shai Evra, Ron Livne, Alex Lubotzky, and Shahar Mozes Constructed Locally Testable Codes with Constant Rate, Distance, and Locality
Top Posts & Pages
 The Logarithmic Minkowski Problem
 To Cheer You Up in Difficult Times 31: Federico Ardila's Four Axioms for Cultivating Diversity
 To Cheer you up in difficult times 30: Irit Dinur, Shai Evra, Ron Livne, Alex Lubotzky, and Shahar Mozes Constructed Locally Testable Codes with Constant Rate, Distance, and Locality
 To cheer you up in difficult times 3: A guest post by Noam Lifshitz on the new hypercontractivity inequality of Peter Keevash, Noam Lifshitz, Eoin Long and Dor Minzer
 Amazing: Feng Pan and Pan Zhang Announced a Way to "Spoof" (Classically Simulate) the Google's Quantum Supremacy Circuit!
 Greatest Hits
 The Argument Against Quantum Computers  A Very Short Introduction
 TYI 30: Expected number of Dice throws
 Test Your Intuition (17): What does it Take to Win TicTacToe
RSS
Tag Archives: Graphcoloring
Coloring Problems for Arrangements of Circles (and Pseudocircles)
To supplement and celebrate Aubrey de Grey’s result here are Eight problems on coloring circles A) Consider a finite family of unit circles. What is the minimum number of colors needed to color the circles so that tangent circles are … Continue reading
Posted in Combinatorics, Geometry, Open problems
Tagged Geometric combinatorics, geometric graphs, Graphcoloring
12 Comments
When Do a Few Colors Suffice?
When can we properly color the vertices of a graph with a few colors? This is a notoriously difficult problem. Things get a little better if we consider simultaneously a graph together with all its induced subgraphs. Recall that an … Continue reading
Around Borsuk’s Conjecture 3: How to Save Borsuk’s conjecture
Borsuk asked in 1933 if every bounded set K of diameter 1 in can be covered by d+1 sets of smaller diameter. A positive answer was referred to as the “Borsuk Conjecture,” and it was disproved by Jeff Kahn and me in 1993. … Continue reading