|
|||||
|
|
Induced subtrees in graphs of large chromatic number |
|
| Authors: | A Gyrfs |
| Institution: | Computer and Automation Institute of the Hungarian Academy of Sciences, Budapest, Hungary Mathematical Institute of the Hungarian Academy of Sciences, Budapest, Hungary Computer and Automation Institute of the Hungarian Academy of Sciences, Budapest, Hungary |
| Abstract: | Our paper proves special cases of the following conjecture: for any fixed tree T there exists a natural number f = f (T) to that every triangle-free graph of chromaticnumber f(T) contains T as an induced subgraph. The main result concerns the case when T has radius two. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |