| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657428 | Journal of Combinatorial Theory, Series B | 2006 | 13 Pages |
Abstract
We prove that every (simple) graph on n⩾9 vertices and at least 7n-27 edges either has a K9 minor, or is isomorphic to K2,2,2,3,3, or is isomorphic to a graph obtained from disjoint copies of K1,2,2,2,2,2 by identifying cliques of size six. The proof of one of our lemmas is computer-assisted.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
