Abstract
Recently, various authors have obtained results about the existence of long cycles in graphs with a given minimum degreed. We extend these results to the case where only some of the vertices are known to have degree at leastd, and we want to find a cycle through as many of these vertices as possible. IfG is a graph onn vertices andW is a set ofw vertices of degree at leastd, we prove that there is a cycle through at least\(\left\lceil {\frac{w}{{\left\lceil {{n \mathord{\left/ {\vphantom {n d}} \right. \kern-\nulldelimiterspace} d}} \right\rceil - 1}}} \right\rceil \) vertices ofW. We also find the extremal graphs for this property.
Similar content being viewed by others
References
N. Alon: The largest cycle of a graph with a large minimal degree,J. Graph Theory 10 (1986), 123–7.
B. Bollobás, andR. Häggkvist: The circumference of a graph with given minimal degree,A Tribute to Paul Erdős (A. Baker, B. Bollobás and A. Hajnal eds.), Cambridge University Press 1989.
G. A. Dirac: Some theorems on abstract graphs,Proc. London Math. Soc. 2 (1952), 69–81.
Y. Egawa, andT. Miyamoto: The longest cycles in a graphG with minimum degree at least|G|/k, J. Combinatorial Theory, Series B 46 (1989), 356–362.
Author information
Authors and Affiliations
Additional information
Research supported in part by NSF Grant DMS 8806097
Rights and permissions
About this article
Cite this article
Bollobás, B., Brightwell, G. Cycles through specified vertices. Combinatorica 13, 147–155 (1993). https://doi.org/10.1007/BF01303200
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01303200