Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4651056 | Discrete Mathematics | 2007 | 9 Pages |
Abstract
The extremal number ex(n;MKp) denotes the maximum number of edges of a graph of order n containing no complete graph Kp as a minor. In this paper we give the exact value of the extremal number ex(n;MKp) for â(5n+9)/8â⩽p⩽â(2n-1)/3â provided that n-p⩾24. Indeed we show that this number is the size of the Turán Graph T2p-n-1(n) and this graph is the only extremal graph.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
M. Cera, A. Diánez, P. GarcÃa-Vázquez, J.C. Valenzuela,