Physical Sciences and Mathematics Commons^™

On KS,T-Minors In Graphs With Given Average Degree, A. V. Kostochka, N. Prince

Faculty Publications & Research

Let D(H) be the minimum d such that every graph G with average degree d has an H-minor. Myers and Thomason found good bounds on D(H) for almost all graphs H and proved that for 'balanced' H random graphs provide extremal examples and determine the extremal function. Examples of 'unbalanced graphs' are complete bipartite graphs K_s,t for a fixed s and large t. Myers proved upper bounds on D(K_s,t ) and made a conjecture on the order of magnitude of D(K_s,t ) for a fixed s and …