Long cycles in subgraphs with prescribed minimum degree (Q1183969)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Long cycles in subgraphs with prescribed minimum degree |
scientific article; zbMATH DE number 33944
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Long cycles in subgraphs with prescribed minimum degree |
scientific article; zbMATH DE number 33944 |
Statements
Long cycles in subgraphs with prescribed minimum degree (English)
0 references
28 June 1992
0 references
Let \(n\), \(d\), \(\ell\) be fixed numbers. The authors determine the minimum number of edges in a graph \(G\) on \(n\) vertices such that the subgraph induced by all vertices of degree at least \(d\) contains a cycle of length \(\ell\) (contains cycles of all lengths up to \(\ell)\).
0 references
circumference
0 references
minimum degree
0 references
cycle
0 references
