Induced subgraphs of graphs with large chromatic number. VI. Banana trees

We investigate which graphs H have the property that in every graph with bounded clique number and sufficiently large chromatic number, some induced subgraph is isomorphic to a subdivision of H. In an earlier paper, the first author proved that every tree has this property; and in another earlier pa...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: Scott, A, Seymour, P
Μορφή: Journal article
Γλώσσα:English
Έκδοση: Elsevier 2020