报告题目：Balanced subdivisions of cliques in graphs

报告简介：In 1984, Thomason conjectured that for each integer k≥1, high average degree is sufficient to guarantee a balanced subdivision of K_k. Recently, Liu and Montgomery resolved this conjecture. We give an optimal estimate up to an absolute constant factor by showing that there exists c>0 such that for sufficiently large d, every graph with average degree at least d contains a balanced subdivision of a clique with at least cd^(1/2) vertices. It also confirms a conjecture from Verstraëte: every graph of average degree cd^2, for some absolute constant c > 0, contains a pair of disjoint isomorphic subdivisions of graph K_d.

报告人：王光辉,山东大学数学学院教授、党委书记，主要从事组合数学基础理论及其在数据科学等领域的应用研究，在Journal of London Mathematical Society、ACM-SIAM Symposium on Discrete Algorithms(SODA)、Journal of Graph Theory、European Journal of Combinatorics、Combinatorics Probability & Computation等期刊会议发表论文40余篇。主持负责国家自然科学基金四项，并承担国家自然科学基金重点项目子课题，获得了2017年山东省青年科技奖和2018年中国运筹学会青年科技奖。

报告时间：2022年5月13日（星期五）上午 9:00-11:00.

报告地点：腾讯会议，ID：389-530-887

主办单位：扬州大学数学科学学院、扬州大学科技处

欢迎广大师生参加！