Proof of a conjecture of Bollobás on nested cycles (Q1907110)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 839134
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof of a conjecture of Bollobás on nested cycles |
scientific article; zbMATH DE number 839134 |
Statements
Proof of a conjecture of Bollobás on nested cycles (English)
0 references
18 February 1996
0 references
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.
0 references
nested cycles
0 references
conjecture of Bollobás
0 references
0.7896127700805664
0 references
0.7785921692848206
0 references
0.7784987092018127
0 references
0.7772871255874634
0 references
