Abstract
Let K*s, t denote the graph obtained from the complete graph K s+t by deleting the edges of some Kt-subgraph. We prove that for each fixed s and sufficiently large t, every graph with chromatic number s+t has a K*s, t minor.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 343-350 |
| Number of pages | 8 |
| Journal | Journal of Graph Theory |
| Volume | 65 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 2010 |
Keywords
- complete bipartite graphs
- graph coloring
- graph minors
ASJC Scopus subject areas
- Geometry and Topology
- Discrete Mathematics and Combinatorics