TAU Combinatorics Seminar 2022/23

When: Sunday January 15, 10am
Where: Schreiber 309
Speaker: Noga Alon, Princeton University and Tel Aviv University
Title: Turán graphs with bounded matching number


We determine the maximum possible number of edges of a graph with $n$ vertices, matching number at most $s$ and clique number at most $k$ for all admissible values of the parameters.

Joint work with Péter Frankl.