报告人：曾庆厚（福州大学）

时  间：7月13日下午16:30

地  点：厦大海韵园数理大楼6楼686会议室

内容摘要:

The celebrated Max-Cut problem asks for the largest bipartite subgraph of a graph. The extremal theory for Max-Cut is now quite well developed. For Max-Bisection, however, much less is known. A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two parts differ by at most 1. Bisection problems are more restricted than cut problems, and the available tools are consequently more limited. In this talk, motivated by several results and conjectures of Alon, Bollobás, Krivelevich and Sudakov, we study Max-Cut and Max-Bisection in H-free graphs and present some recent results in this area. This talk contains joint work with Jianfeng Hou and joint work with Jing Lin.

个人简介：

曾庆厚，男，博士，硕士生导师。2017年6月毕业于福州大学离散数学研究中心，获理学博士学位，导师范更华教授、侯建锋教授。同年8月至2019年10月在中国科学技术大学数学科学学院从事博士后研究工作，合作导师马杰教授；2019年11月进入福州大学数学与计算机科学学院工作。主要从事图论及其应用等领域的研究，在Journal of Combinatorial Theory Series A、Combinatorics Probability Computing、SIAM Journal on Discrete Mathematics及Journal of Graph Theory等国内外重要期刊发表学术论文十余篇。主持国家自然科学基金青年项目1项、中国博士后科学基金面上资助1项。

联系人：卢安晞