Disjoint Kr-minors in large graphs with given average degree
نویسندگان
چکیده
منابع مشابه
Disjoint Kr-minors in large graphs with given average degree
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 . © 2005 Published by Elsevier Ltd
متن کاملOn Ks, t-minors in graphs with given average degree
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 onD(H) for almost all graphsH and proved that for ‘balanced’H random graphs provide extremal examples and determine the extremal function. Examples of ‘unbalanced graphs’ are complete bipartite graphs Ks,t for a fixed s and large t. Myers proved upper bounds on D(Ks,t ) a...
متن کاملOn Ks, t-minors in graphs with given average degree, II
Let K∗ s,t denote the graph obtained from Ks,t by adding all edges between the s vertices of degree t in it. We show how to adapt the argument of an our previous paper (Discrete Math. 308 (2008), 4435–4445) to prove that if t/ log2 t ≥ 1000s, then every graph G with average degree at least t + 8s log2 s has a K∗ s,t minor. This refines a corresponding result by Kühn and Osthus. AMS Subject Clas...
متن کاملLarge minors in graphs with given independence number
Aweakening of Hadwiger’s conjecture states that every n-vertex graphwith independence number α has a clique minor of size at least n α . Extending ideas of Fox (2010) [6], we prove that such a graph has a clique minor with at least n (2−c)α vertices where c > 1/19.2. © 2011 Elsevier B.V. All rights reserved.
متن کاملLarge Minors in Graphs with a given Stability Number
A weakening of Hadwiger’s Conjecture states that every n-vertex graph with independence number α has a clique minor of size at least n α . Extending ideas of Fox [6], we prove that such a graph has a clique minor with at least n (2−c)α vertices where c > 1/19.2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2005
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2003.12.017