Abstract
In 1980, Bondy conjectured a common generalization (depending on λ) of some well-known degree-sum conditions for a graph ensuring the existence of Hamilton cycles for λ = 1 (Ore, 1960) and dominating cycles for λ = 2 (Bondy, 1980) as special cases. The reverse (long-cycle) version of Bondy’s conjecture was proposed in 2001 due to Jung. The importance of these two conjectures in the field is motivated by the fact that they (as starting points) give rise to all (with few exceptions) further developments through various additional extensions and limitations. In this paper, we briefly outline all known notable achievements towards solving the problem: (i) confirmation (by the author) of Bondy’s and Jung’s conjectures for some versions that are very close to the original versions; and (ii) significant improvements (by the author) of results (i), inspiring a number of improved versions of original conjectures of Bondy and Jung. Next we derive a number of modifications from improvements in (ii), which are also very close to the original versions, but do not follow directly from the Bondy’s and Young’s conjectures. Finally, all results (both old and new) are shown to be best possible in a sense based on three types of sharpness, indicating the intervals in 0 < λ < δ + 1 where the result is sharp and the intervals where the result can be further improved, where δ denotes the minimum degree.
This is a preview of subscription content, log in via an institution to check access.
REFERENCES
J. C. Bermond, “On Hamiltonian walks,” Congressus Numerantium 15, 41–50 (1976).
J. A. Bondy, “Large cycles in graphs,” Discrete Math. 1, 121–132 (1971). https://doi.org/10.1016/0012-365x(71)90019-7
J. A. Bondy, “Longest paths and cycles in graphs of high degree,” in Research Report CORR 80-16 (Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Canada, 1980).
J. A. Bondy and U. S. R. Murty, Graph Theory with Applications (Macmillan, London, 1976).
S. Chiba, M. Tsugaki, and T. Yamashita, “Degree sum conditions for the circumference of 4-connected graphs,” Discrete Math. 333, 66–83 (2014). https://doi.org/10.1016/j.disc.2014.06.012
G. A. Dirac, “Some theorems on abstract graphs,” Proc. London Math. Soc. 2, 69–81 (1952). https://doi.org/10.1112/plms/s3-2.1.69
G. Fan, “Extremal theorems on paths and cycles in graphs and weighted graphs,” PhD Thesis (Univ. of Waterloo, Waterloo, Canada, 1987).
P. Fraisse and H. A. Jung, “Longest cycles and independent sets in k-connected graphs,” in Recent Studies in Graph Theory, Ed. by V. R. Kulli (Vischwa Int., Gulbarga, India, 1989), pp. 114–139.
H. A. Jung, “Longest cycles in graphs with moderate connectivity,” in Topics in Combinatorics and Graph Theory, Essays in Honour of Gerhard Ringel, Ed. by R. Bodendiek and R. Henn (Physica-Verlag HD, Heidelberg, 1990), pp. 765–778. https://doi.org/10.1007/978-3-642-46908-4_86
H. A. Jung, “Degree bounds for long paths and cycles in k-connected graphs,” in Computational Discrete Mathematics, Ed. by H. Alt, Lecture Notes in Computer Sciences, Vol. 2122 (Springer, Berlin, 2001), pp. 56–60. https://doi.org/10.1007/3-540-45506-x_5
N. Linial, “A lower bound for the circumference of a graph,” Discrete Math. 15, 297–300 (1976). https://doi.org/10.1016/0012-365x(76)90031-5
C. St. J. A. Nash-Williams, “Edge-disjoint Hamiltonian cycles in graphs with vertices of large valency,” in Studies in Pure Mathematics, Ed. by L. Mirsky (Academic, San Diego, 1971), pp. 157–183.
Zh. G. Nikoghosyan, “Path-extensions and long cycles in graphs,” Math. Probl. Comput. Sci. 19, 25–31 (1998). https://arar.sci.am/dlibra/publication/281386/edition/258334/content?ref=struct
Zh. G. Nikoghosyan, “Cycle-extensions and long cycles in graphs,” Math. Probl. Comput. Sci. 21, 121–128 (2000). https://arar.sci.am/dlibra/publication/281443/edition/258386/content
Zh. G. Nikoghosyan, “Cycle-extensions and long cycles in κ-connected graphs,” Math. Probl. Comput. Sci. 21, 129–155 (2000). https://arar.sci.am/dlibra/publication/281443/edition/258386/content
Zh. G. Nikoghosyan, “Dirac-type generalizations concerning large cycles in graphs,” Discrete Math. 309, 1925–1930 (2009). https://doi.org/10.1016/j.disc.2008.03.011
Zh. G. Nikoghosyan, “Advanced lower bounds for the circumference,” Graphs Combinatorics 29, 1531–1541 (2013). https://doi.org/10.1007/s00373-012-1209-4
Zh. G. Nikoghosyan, “A note on large cycles in graphs around conjectures of Bondy and Jung,” Math. Probl. Comput. Sci. 59, 7–15 (2023). https://doi.org/10.51408/1963-0097
O. Ore, “Note on Hamilton circuits,” Am. Math. Mon. 67, 55 (1960). https://doi.org/10.2307/2308928
H. J. Veldman, “Existence of D λ-cycles and D λ-paths,” Discrete Math. 44, 309–316 (1983). https://doi.org/10.1016/0012-365x(83)90196-6
H.-J. Voss and C. Zuluaga, “Maximale gerade und ungerade Kreise in Graphen I,” Wiss. Z. Techn. Hochschule Ilmenau 4, 57–70 (1977).
Y. Zou, “A generalization of a theorem of Jung,” J. Nanjing Normal Univ. Nat. Sci. 2, 8–11 (1987).
Funding
This work was supported by ongoing institutional funding. No additional grants to carry out or direct this particular research were obtained.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The author of this work declares that he has no conflicts of interest.
Additional information
Zhora Geghamovich Nikoghosyan, received the M.Sc. degree in Applied Mathematics from Yerevan State University and the PhD degree in Mathematical Cybernetics from Minsk Institute of Mathematics, Byeloruss Academy of Sciences. He is currently a leading researcher with the Institute for Informatics and Automation Problems, National Academy of Sciences, Republic of Armenia. His research interests include: Discrete Mathematics, Combinatorics, Graph Theory, Existence problems of large (long) cycles in graphs including Hamilton and Dominating cycles as special cases, Spanning Trees with few end (branch) vertices. The author’s name appears in the following versions: G.G. Nicoghossian (1974–1998), Zh.G. Nikoghosyan, Zhora Nikoghosyan, Zhora G. Nikoghosyan.
Publisher’s Note.
Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Nikoghosyan, Z.G. Large Cycles in Graphs around Bondy’s and Jung’s Conjectures – Modifications, Sharpness, and Perspectives. Pattern Recognit. Image Anal. 34, 49–61 (2024). https://doi.org/10.1134/S1054661824010140
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1054661824010140