- 离散数学研究讨论班

Finite Hypergraph Families with Rich Extremal Turan Constructions via Mixing Patterns

组织者

本杰明·苏达科夫

演讲者

Oleg Pikhurko

时间

2023年02月28日 17:05 至 18:15

地点

Online

线上

Zoom 787 662 9899 (BIMSA)

摘要

Previously, it was shown by the speaker that for any $k$-graph pattern $P$ there is a finite forbidden family $F$ such that maximum recursive blow-ups of $P$ are precisely maximum $F$-free $k$-graphs. I will discuss joint work with Xizhi Liu where we extend this result by allowing to mix different patterns and present some applications to finding finite forbidden families with rich sets of (almost) extremal Turan constructions.

演讲者介绍

Oleg Pikhurko obtained a 5-year Diploma from L'viv State University, Ukraine, in 1995 and a PhD from the University of Cambridge in 2000. He was a Junior Research Fellow at St John's College, Cambridge (2000-2003) and an Assistant/Associate Professor at Carnegie Mellon University, before moving to the University of Warwick in 2011. He is a recipient of an ERC Starting Grant (2013-9) and an on-going ERC Advanced Grant (2022-2026).