| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656877 | Journal of Combinatorial Theory, Series B | 2014 | 6 Pages |
Abstract
This in turn is a consequence of a bound on the maximum number of vertices in any graph that is minimal not k-split, a result first proved by Gyárfás [5] and for which we give a short proof.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Maria Chudnovsky, Paul Seymour,