地点： K2-525
摘要：A family ${\cal G}$ of graph is $\chi$-bounded if there is a function $f$ such that $\chi(G)\le f(\omega(G))$ for every graph $G\in {\cal G}$. It is known that $\chi(G)\le 5\cdot 3^{\omega(G)-3}$ if $G$ is a $P_5$-free graph with $\omega(G)\ge 3$, and it is conjectured that $P_5$-free graphs has polynomial binding function. In this talk, I will present some results on the chromatic number of some $P_5$-free graphs.
