- Call for nominations for the Ostrowski Prize 2017
- Problems for Imre Bárány’s Birthday!
- Twelves short videos about members of the Department of Mathematics and Statistics at the University of Victoria
- Jozsef Solymosi is Giving the 2017 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science
- Updates (belated) Between New Haven, Jerusalem, and Tel-Aviv
- Oded Goldreich Fest
- The Race to Quantum Technologies and Quantum Computers (Useful Links)
- Around the Garsia-Stanley’s Partitioning Conjecture
- My Answer to TYI- 28
Top Posts & Pages
- Academic Degrees and Sex
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Updates and plans III.
- When It Rains It Pours
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
- Believing that the Earth is Round When it Matters
- AlexFest: 60 Faces of Groups
- Why Quantum Computers Cannot Work: The Movie!
- Emmanuel Abbe: Erdal Arıkan's Polar Codes
Tag Archives: Graph-coloring
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
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