Keynote Speaker: Xu Baogang

      Abstract:

A graph G is k-divisible if for each induced subgraph H of G, either H is a stable set, or V(H) can be partitioned into k sets of which each induces a subgraph with clique number less than ω(G), and is perfectly divisible if for each induced subgraph H of G, V(H) can be partitioned into two sets A and B such that H(A) is perfect and ω[H(B)]<ω(H). In this talk, we will present some results on 2-divisibility and perfect divisibility of odd hole free graphs (joint work with Wei Dong and Jialei Song).

Speaker Introduction:

 Xu Baogang,professor of Nanjing Normal University

Inviter:

 Yan Jin, professor of School of Mathematics

Time:

 10:00 on October 14 (Monday)

Location:

Hall 924, Block B, Zhixin Building, Central Campus

Sponsored by: School of Mathematics, Shandong University