Article ID Journal Published Year Pages File Type
10118362 European Journal of Combinatorics 2005 4 Pages PDF
Abstract
It is proved that there are functions f(r) and N(r,s) such that for every positive integer r, s, each graph G with average degree d(G)=2|E(G)|/|V(G)|≥f(r), and with at least N(r,s) vertices has a minor isomorphic to Kr,s or to the union of s disjoint copies of Kr.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,