Tag Archives: Yuval Filmus

Tomorrow: Boolean functions day at the TAU theory fest

As part of the 2019/2020 TAU theory fest, tomorrow, Friday, January 3, 2020,  is a Boolean function day at Tel Aviv University. The five speakers are Esty Kelman, Noam Lifschitz, Renan Gross, Ohad Klein, and Naomi Kirshner. For more (and … Continue reading

Posted in Combinatorics, Conferences, Convex polytopes | Tagged , , , , , , , | Leave a comment

The Simonovits-Sos Conjecture was Proved by Ellis, Filmus and Friedgut

Simonovits and Sos asked: Let be a family of graphs with N={1,2,…,n} as the set of vertices. Suppose that every two graphs in the family have a triangle in common. How large can be? (We talked about it in this post.) … Continue reading

Posted in Combinatorics, Open problems | Tagged , , , | 10 Comments