Subdivisions of a graph of maximal degree n+1 in graphs of average degree n+epsilon and large girth

Authors
Mader, W
Citation
W. Mader, Subdivisions of a graph of maximal degree n+1 in graphs of average degree n+epsilon and large girth, COMBINATORI, 21(2), 2001, pp. 251-265
Citations number
21
Categorie Soggetti
Mathematics,"Computer Science & Engineering
Journal title
COMBINATORICA
ISSN journal
02099683 → ACNP
Volume
21
Issue
2
Year of publication
2001
Pages
251 - 265
Database
ISI
SICI code
0209-9683(2001)21:2<251:SOAGOM>2.0.ZU;2-P
Abstract
It is proved that for every finite graph H of maximal degree n + 1 greater than or equal to 3 and every epsilon > 0, there is an integer t(H, epsilon) such that every finite graph of average degree at least n + epsilon and of girth st least t(H, epsilon) contains a subdivision of H.