We prove that for every
k there exists
d=
d(
k)
such that every graph of average degree at least
d contains a subgraph of
average degree at least
k and
girth at least six. This settles a special case of a conjecture
of Thomassen.
Mathematics Subject
Classification (2000): 05C35 - 05D40