Holes in graphs of large chromatic number
Formal Metadata
| Title | Holes in graphs of large chromatic number |
|
| Title of Series | |
| Number of Parts | 24 |
| Author | |
| License | You are free to use, copy, distribute and transmit the work or content in unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor. |
| Identifiers | |
| Publisher | |
| Release Date | |
| Language | |
Content Metadata
| Subject Area | |
| Genre | |
| Abstract | Let G be a graph with large chromatic number. What induced subgraphs must it contain? It may contain a large complete subgraph, but what can we say if this is not the case? We will survey recent work on this topic, concentrating on the question of finding induced cycles. In particular, we will discuss recent results with Paul Seymour, Maria Chudnovsky and Sophie Spirkl. |
|
| Keywords | |
