par Dujmović, Vida V.;Harvey, Daniel;Joret, Gwenaël 
;Reed, Bruce;Wood, D.
Référence SIAM journal on discrete mathematics, 27, 4, page (1770--1774)
Publication Publié, 2013
;Reed, Bruce;Wood, D.Référence SIAM journal on discrete mathematics, 27, 4, page (1770--1774)
Publication Publié, 2013
Article révisé par les pairs
| Résumé : | Let g(t) be the minimum number such that every graph G with average degree d(G) = g(t) contains a Kt-minor. Such a function is known to exist, as originally shown by Mader. Kostochka and Thomason independently proved that g(t) and T(t√log t). This paper shows that for all fixed and < 0 and fixed sufficiently large t = t(and), if d(G) = (2 + and)g(t), then we can find this Kt-minor in linear time. This improves a previous result by Reed and Wood who gave a linear-time algorithm when d(G) = 2t-2. © 2013 Society for Industrial and Applied Mathematics. |
