# 12月12日 许宝刚教授学术报告（数学与统计学院）

许宝刚，博士，南京师范大学教授，博士生导师。主持完成国家自然科学基金5项，主持国家自然科学基金重点项目1项，参加国家自然科学基金2项。长期从事图的染色与划分问题的研究，在图的染色与划分方面做了很多有国际影响的优秀工作，解决了由国际著名图论学家提出的一系列猜想与问题。 2006年入选江苏省省“青蓝工程程”学术带头人培养人选；2011年-2017年受聘为南京师范大学特聘教授。担任中国运筹学会常务理事；中国数学会组合数学与图论专业委员会副主任；中国运筹学会图论与组合分会常务理事。中国运筹学会会刊（英文版）Journal of the Operations Research Society of China 编委。

A hole is an induced cycle of length at least four, and an odd/even hole is one of length odd/even. Let $k\ge 2$ be an integer.  A graph $G$ is said to be  $k$-divisible if for each induced subgraph $H$ of $G$, either $H$ is a stable set or $V(H)$ can be partitioned into $k$ subsets of which each induces a subgraph with clique number less than that of $H$, and is said to be perfectly divisible if for each induced subgraph $H$ of $G$,$V(H)$ admits a partition into two $A$ and $B$ of which one induces a perfect subgraph and the other induces a subgraph with clique number less than $\omega(H)$. In this talk, we will present some  problems  and results on 2-divisibility and perfect divisibility of odd hole free graphs (joint work with Wei Dong and Jialei Song).

/