Title of article
The Extremal Function for Complete Minors
Author/Authors
Thomason، نويسنده , , Andrew، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
21
From page
318
To page
338
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 thatc(t)=(α+o(1)) t log twhere α=0.319... is an explicit constant. Random graphs are extremal graphs.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2001
Journal title
Journal of Combinatorial Theory Series B
Record number
1526792
Link To Document