Recent Comments

Recent Posts
 To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky’s conjectures
 Nostalgia corner: John Riordan’s referee report of my first paper
 At the Movies III: Picture a Scientist
 At the Movies II: Kobi Mizrahi’s short movie White Eye makes it to the Oscar’s short list.
 And the Oscar goes to: Meir Feder, Zvi Reznic, Guy Dorman, and Ron Yogev
 Thomas Vidick: What it is that we do
 To cheer you up in difficult times 20: Ben Green presents superpolynomial lower bounds for offdiagonal van der Waerden numbers W(3,k)
 To cheer you up in difficult times 19: Nati Linial and Adi Shraibman construct larger cornerfree sets from better numbersontheforehead protocols
 Possible future Polymath projects (2009, 2021)
Top Posts & Pages
 To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky's conjectures
 The Argument Against Quantum Computers  A Very Short Introduction
 Possible future Polymath projects (2009, 2021)
 8866128975287528³+(8778405442862239)³+(2736111468807040)³
 TYI 30: Expected number of Dice throws
 Photonic Huge Quantum Advantage ???
 Jean
 ICM 2018 Rio (3)  Coifman, Goldstein, Kronheimer and Mrowka, and the Four Color Theorem
 Dan Romik on the Riemann zeta function
RSS
Tag Archives: Peter Frankl
The BrownErdősSós 1973 Conjecture
Greetings from Oberwolfach. This week, there is a great meeting here on combinatorics. In this post I want to state the BrownErdősSós conjecture and one of its variants. The trigger was a beautiful talk I heard from Lior Gishboliner on … Continue reading
Three Pictures
With Tolya (Anatoly) Vershik, Saint Petersburg, 2003 Peter Frankl and Voita (Vojtěch) Rödl, NYC, summer 1986 (or 1987). This post mentions the FranklRödl theorem. Jeroen Zuiddam at IAS, a few days ago. (See this post) We just moved to a … Continue reading
Frankl’s Conjecture for Large Families: Ilan Karpas’ Proof
Frankl’s conjecture asserts that a for every finite family of of finite sets that is closed under union, there is an element that belongs to at least half the sets in the family. We mentioned the problem in our very … Continue reading
Hardness of Approximating Vertex Cover, PolytopeIntegralityGap, the AlswedeKachatrian theorem, and More.
Lior Silberman asked about applications of the 2to2 game theorem to hardness of approximation, and James Lee answered mentioning applications to vertex cover. Let me elaborate a little on vertex cover, and other matters. (Here is the pervious post on … Continue reading
Ilan Karpas: Frankl’s Conjecture for Large Families
Frankl’s conjecture Frankl’s conjecture is the following: Let be a finite family of finite subsets of which is closed under union, namely, if then also . Then there exists an element which belongs to at least half the sets in . … Continue reading
Posted in Combinatorics, Open problems
Tagged Abigail Raz, Frankl's conjecture, Ilan Karpas, Peter Frankl
3 Comments
Preview: The solution by Keller and Lifshitz to several open problems in extremal combinatorics
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 David Ellis, Ehud Friedgut, Michel Deza, Nathan Keller, Noam Lifshitz, Paul Erdos, Peter Frankl, Zoltán Füredi
1 Comment
News (mainly polymath related)
Update (Jan 21) j) Polymath11 (?) Tim Gowers’s proposed a polymath project on Frankl’s conjecture. If it will get off the ground we will have (with polymath10) two projects running in parallel which is very nice. (In the comments Jon Awbrey gave … Continue reading
A lecture by Noga
Noga with Uri Feige among various other heroes A few weeks ago I devoted a post to the 240summit conference for Péter Frankl, Zoltán Füredi, Ervin Győri and János Pach, and today I will bring you the slides of Noga … Continue reading
Posted in Combinatorics, Conferences
Tagged Ankur Moitra, Benny Sudakov, Ervin Győri, János Pach, Noga Alon, Peter Frankl, Zoltán Füredi
Leave a comment
Extremal Combinatorics VI: The FranklWilson Theorem
Rick Wilson The FranklWilson theorem is a remarkable theorem with many amazing applications. It has several proofs, all based on linear algebra methods (also referred to as dimension arguments). The original proof is based on a careful study of incidence … Continue reading
Combinatorics, Mathematics, Academics, Polemics, …
1. About: My name is Gil Kalai and I am a mathematician working mainly in the field of Combinatorics. Within combinatorics, I work mainly on geometric combinatorics and the study of convex polytopes and related objects, and on the analysis of Boolean functions … Continue reading