Proof of a Conjecture of Bollob?s on Nested Cycles

For any positive integerk, a minimum degree condition is obtained which forces a graph to havekedge-disjoint cyclesC1,C2, …,Ck, such thatV(C1)⊇V(C2)⊇…⊇V(Ck). This confirms a conjecture of Bollobás.