Abstract
Let c(t) be the minimum number c such that every graph G with e(G)≥c \G\ contracts to a complete graph Kt. We show that c(t) = (α + o(1))t √log t where α = 0.319... is an explicit constant. Random graphs are extremal graphs. © 2001 Academic Press.
Cite
CITATION STYLE
APA
Thomason, A. (2001). The Extremal Function for Complete Minors. Journal of Combinatorial Theory. Series B, 81(2), 318–338. https://doi.org/10.1006/jctb.2000.2013
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free