Proof of a conjecture of Bollobás on nested cycles
Cycles \(C_1\), \(C_2, \dots, C_k\) are nested if they are edge- disjoint and their vertex sets satisfy \(V(C_1) \supseteq V(C_2) \supseteq \cdots \supseteq V(C_k)\). For every positive integer \(k\), a constant \(d_k\) is obtained with the property that a graph with minimum degree \(d_k\) must contain \(k\) nested cycles. This confirms a conjecture of Bollobás.
scientific article; zbMATH DE number 839134