Speaker: Liu Hong, the head of the Extremal Combinatorics and Probability Group and a distinguished research fellow at the Institute for Basic Science

Date: May 27, 2025

Time: 9:00-10:00 am

Location: C704, Zhixin Building, Shandong University

Sponsor: School of Mathematics, Shandong University

Abstract:

We prove a version of sparsification result for multipartite graphs which finds within any multipartite graph with positive pairwise densities, a bounded order subgraph with sufficiently many parts and almost the same pairwise densities. Asan application, we settle a multicolor Turan problem first suggested by Bollobas. This is joint work with Ander Lamaison.

For more information, please visit:

https://www.view.sdu.edu.cn/info/1020/202552.htm