Large Cycles in Graphs around Bondy’s and Jung’s Conjectures – Modifications, Sharpness, and Perspectives

IF 0.7 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Zh. G. Nikoghosyan
{"title":"Large Cycles in Graphs around Bondy’s and Jung’s Conjectures – Modifications, Sharpness, and Perspectives","authors":"Zh. G. Nikoghosyan","doi":"10.1134/s1054661824010140","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>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 &lt; λ &lt; δ + 1 where the result is sharp and the intervals where the result can be further improved, where δ denotes the minimum degree.</p>","PeriodicalId":35400,"journal":{"name":"PATTERN RECOGNITION AND IMAGE ANALYSIS","volume":"17 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PATTERN RECOGNITION AND IMAGE ANALYSIS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1134/s1054661824010140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

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.

围绕邦迪猜想和荣格猜想的图中大循环--修正、锐度和视角
摘要 1980 年,Bondy 猜想了一些著名的图的度和条件的普通一般化(取决于 λ),确保在 λ = 1 时存在 Hamilton 循环(Ore,1960 年),在 λ = 2 时存在支配循环(Bondy,1980 年)作为特例。邦迪猜想的反向(长周期)版本是由荣格于 2001 年提出的。这两个猜想在该领域的重要性在于,它们(作为起点)通过各种额外的扩展和限制引起了所有(除少数例外)进一步的发展。在本文中,我们简要概述了为解决这一问题而取得的所有已知显著成就:(i) (作者)证实了邦迪和荣格猜想的某些版本与原始版本非常接近;(ii) (作者)对结果(i)进行了重大改进,激发了邦迪和荣格原始猜想的许多改进版本。接下来,我们从第(ii)项的改进中推导出一些修改,这些修改也非常接近原始版本,但并不直接来自邦迪和杨的猜想。最后,所有结果(包括新旧结果)都被证明是基于三种尖锐度的最佳结果,这三种尖锐度分别表示 0 < λ < δ + 1 中结果尖锐的区间和结果可以进一步改进的区间,其中 δ 表示最小度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
PATTERN RECOGNITION AND IMAGE ANALYSIS
PATTERN RECOGNITION AND IMAGE ANALYSIS Computer Science-Computer Graphics and Computer-Aided Design
CiteScore
1.80
自引率
20.00%
发文量
80
期刊介绍: The purpose of the journal is to publish high-quality peer-reviewed scientific and technical materials that present the results of fundamental and applied scientific research in the field of image processing, recognition, analysis and understanding, pattern recognition, artificial intelligence, and related fields of theoretical and applied computer science and applied mathematics. The policy of the journal provides for the rapid publication of original scientific articles, analytical reviews, articles of the world''s leading scientists and specialists on the subject of the journal solicited by the editorial board, special thematic issues, proceedings of the world''s leading scientific conferences and seminars, as well as short reports containing new results of fundamental and applied research in the field of mathematical theory and methodology of image analysis, mathematical theory and methodology of image recognition, and mathematical foundations and methodology of artificial intelligence. The journal also publishes articles on the use of the apparatus and methods of the mathematical theory of image analysis and the mathematical theory of image recognition for the development of new information technologies and their supporting software and algorithmic complexes and systems for solving complex and particularly important applied problems. The main scientific areas are the mathematical theory of image analysis and the mathematical theory of pattern recognition. The journal also embraces the problems of analyzing and evaluating poorly formalized, poorly structured, incomplete, contradictory and noisy information, including artificial intelligence, bioinformatics, medical informatics, data mining, big data analysis, machine vision, data representation and modeling, data and knowledge extraction from images, machine learning, forecasting, machine graphics, databases, knowledge bases, medical and technical diagnostics, neural networks, specialized software, specialized computational architectures for information analysis and evaluation, linguistic, psychological, psychophysical, and physiological aspects of image analysis and pattern recognition, applied problems, and related problems. Articles can be submitted either in English or Russian. The English language is preferable. Pattern Recognition and Image Analysis is a hybrid journal that publishes mostly subscription articles that are free of charge for the authors, but also accepts Open Access articles with article processing charges. The journal is one of the top 10 global periodicals on image analysis and pattern recognition and is the only publication on this topic in the Russian Federation, Central and Eastern Europe.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信