## Zentralblatt MATH

Publications of (and about) Paul Erdös

Zbl.No:  835.05036
Autor:  Chen, Guantao; Erdös, Paul; Staton, William
Title:  Proof of a conjecture of Bollobás on nested cycles. (In English)
Source:  J. Comb. Theory, Ser. B 66, No.1, 38-43 (1996).
Review:  Cycles C1, C2, ..., Ck are nested if they are edge- disjoint and their vertex sets satisfy V(C1) \supseteq V(C2) \supseteq ··· \supseteq V(Ck). For every positive integer k, a constant dk is obtained with the property that a graph with minimum degree dk must contain k nested cycles. This confirms a conjecture of Bollobás.
Reviewer:  W.Staton (Mississippi)
Classif.:  * 05C38 Paths and cycles
05C35 Extremal problems (graph theory)
Keywords:  nested cycles; conjecture of Bollobás

© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag