Proof of a conjecture of Bollobás on nested cycles
type: Item
instance of: scholarly article
title: Proof of a conjecture of Bollobás on nested cycles
zbMATH Open document ID: 0835.05036
author: William Staton
author: Guantao Chen
author: P. Erdős
published in: Journal of Combinatorial Theory. Series B
publication date: 1996-02-18T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 839134
zbMATH Keywords: nested cycles
zbMATH Keywords: conjecture of Bollobás
Wikidata QID: Q105518380
MaRDI profile type: Publication
full work available at URL: jctb.1996.0005
OpenAlex ID: W2051610180
DOI: 10.1006/JCTB.1996.0005
description: scientific article; zbMATH DE number 839134