Tag Archives: Paul Erdos

To cheer you up 14: Hong Liu and Richard Montgomery solved the Erdős and Hajnal’s odd cycle problem

Posted on November 17, 2020 by Gil Kalai

The news: In 1981, Paul Erdős and András Hajnal asked whether the sum of the reciprocals of the odd cycle lengths in a graph with infinite chromatic number is necessarily infinite. Hong Liu and Richard Montgomery have just proved that … Continue reading →

Posted in Combinatorics | Tagged , , , , | 7 Comments

To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter

Posted on May 30, 2020 by Gil Kalai

Here is a piece of news that will certainly cheer you up: Florian Richter found A new elementary proof of the prime number theorem. (I thank Tami Ziegler for telling me about the new result.) From left to right: Atle Selberg, … Continue reading →

Posted in Number theory, Updates | Tagged , , | 11 Comments

The Brown-Erdős-Sós 1973 Conjecture

Posted on January 8, 2020 by Gil Kalai

Greetings from Oberwolfach.  This week, there is a great meeting here on combinatorics. In this post I want to state the Brown-Erdős-Sós conjecture and one of its variants. The trigger was a beautiful talk I heard from Lior Gishboliner on … Continue reading →

Posted in Combinatorics | Tagged , , , , , , , , , , , , , , | 2 Comments

The (Random) Matrix and more

Posted on April 21, 2019 by Gil Kalai

Three pictures, and a few related links. Van Vu Spoiler: In one of the most intense scenes, the protagonist, with his bare hands and against all odds, took care of the mighty Wigner semi-circle law in two different ways. (From … Continue reading →

Posted in Combinatorics, People, What is Mathematics | Tagged , , , , , , | 1 Comment

Igor Pak will give the 2018 Erdős Lectures

Posted on December 5, 2018 by Gil Kalai

  Next week Igor Pak will give the 2018 Erdős Lectures (delayed from June) Here is the poster   Combinatorics — Erdos lecture: Igor Pak (UCLA) “Counting linear extensions” Monday December 10  11:00-13:00 Location:  IIAS Hall 130, Feldman building,  Givat Ram     … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Updates | Tagged , , | Leave a comment

Preview: The solution by Keller and Lifshitz to several open problems in extremal combinatorics

Posted on December 10, 2017 by Gil Kalai

Peter Frankl (right) and Zoltan Furedi The news A new paper by Nathan Keller and Noam Lifshitz settles several open problems in extremal combinatorics for wide range of parameters. Those include the three problems we mention next. Three central open … Continue reading →

Posted in Combinatorics, Open problems, Updates | Tagged , , , , , , , | 1 Comment

Jozsef Solymosi is Giving the 2017 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science

Posted on May 3, 2017 by Gil Kalai

                            May 4 2:30-3:30; May 7 11:00-13:00; May 10 10:30-12:00 See the event webpage for titles and abstracts (or click on the picture below).  

Posted in Combinatorics, Geometry, Updates | Tagged , | Leave a comment

Polymath10: The Erdos Rado Delta System Conjecture

Posted on November 3, 2015 by Gil Kalai

The purpose of this post is to start the polymath10 project. It is one of the nine projects (project 3d) proposed by Tim Gowers in his post “possible future polymath projects”. The plan is to attack Erdos-Rado delta system conjecture also known as the … Continue reading →

Posted in Combinatorics, Polymath10 | Tagged , , , | 141 Comments

EDP Reflections and Celebrations

Posted on October 22, 2015 by Gil Kalai

The Problem In 1932, Erdős conjectured: Erdős Discrepancy Conjecture (EDC)  [Problem 9 here] For any constant , there is an such that the following holds. For any function , there exists an   and a   such that For any , … Continue reading →

Posted in Combinatorics, Number theory | Tagged , | 4 Comments

Erdős Lectures 2014 – Dan Spielman

Posted on May 16, 2014 by Gil Kalai
Posted in Updates | Tagged , | 1 Comment