论文部分内容阅读
In 1970's,Erd(o)os and Hajnal conjectured that for any numbers k and g,there exists a number f(k,g),such that every graph with chromatic number at least f(k,g)contains a subgraph with chromatic number at least k and girth at least g.