Talk information

Date: Sunday, January 15, 2023
Time: 10:10–11:00
Place: Schreiber 309
Speaker: Noga Alon (Princeton University and TAU)
Title: Tur\'an graphs with bounded matching number

Abstract:

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.