Clique Minors in Graphs and Their Comple
β
Bruce Reed; Robin Thomas
π
Article
π
2000
π
Elsevier Science
π
English
β 107 KB
A graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting edges. Let t 1 be an integer, and let G be a graph on n vertices with no minor isomorphic to K t+1 . Kostochka conjectures that there exists a constant c=c(t) independent of G such that the complement of G has