Large independent sets from local considerations
Benny Sudakov (Zurich)
20-Nov-2020, 14:00-15:00 (3 years ago)
Abstract: How well can global properties of a graph be inferred from observations that are purely local? This general question gives rise to numerous interesting problems. One such very natural question was raised independently by Erdos-Hajnal and Linial-Rabinovich in the early 90's. How large must the independence number $\alpha (G)$ of a graph $G$ be whose every $m$ vertices contain an independent set of size $r$? In this talk we discuss new methods to attack this problem which improve many previous results.
combinatorics
Audience: researchers in the topic
Series comments: This is the online combinatorics seminar at Warwick.
Organizers: | Jan Grebik, Oleg Pikhurko |
Curator: | Hong Liu* |
*contact for this listing |
Export talk to