For any positive integer k, a minimum degree condition is obtained which forces a graph to have k edge-disjoint cycles C1, C2, ..., Ck such that V(C1) ⊇ V(C2) ⊇ ⋯ ⊇ V(Ck). This confirms a conjecture of Bollobás.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics