Monthly Archives: May 2015

Choongbum Lee proved the Burr-Erdős conjecture

Posted on May 22, 2015 by Gil Kalai

Let be a graph. The Ramsey number is the smallest such that whenever you color the edges of the complete graph with vertices with two colors blue and red, you can either find a blue copy or a red copy … Continue reading →

Posted in Combinatorics, Updates | Tagged Choongbum Lee, Ramsey theory | 2 Comments

More Reasons for Small Influence

Posted on May 13, 2015 by Gil Kalai

Readers of the big-league ToC blogs have already heard about the breakthrough paper An average-case depth hierarchy theorem for Boolean circuits by Benjamin Rossman, Rocco Servedio, and Li-Yang Tan. Here are blog reports on Computational complexity, on the Shtetl Optimized, and of Godel … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Open problems, Probability | 13 Comments

	Avinoam Mann on To cheer you up in difficult t…
	Gil Kalai on To cheer you up in difficult t…
	Avinoam Mann on To cheer you up in difficult t…
	To cheer you up in d… on @HUJI
	To cheer you up in d… on To Cheer You Up in Difficult T…
	55 Best Computer Sci… on Possible future Polymath proje…
	Understanding The Ma… on TYI 30: Expected number of Dic…
	Gil Kalai on To cheer you up in difficult t…
	Gil Kalai on Nostalgia corner: John Riordan…
	Polymath projects 20… on Possible future Polymath proje…
	Gil Kalai on Chess can be a Game of Lu…
	Steve on Nostalgia corner: John Riordan…

Monthly Archives: May 2015

Choongbum Lee proved the Burr-Erdős conjecture

More Reasons for Small Influence

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives