图中最大匹配的平均大小

IF 0.9 4区 数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot
{"title":"图中最大匹配的平均大小","authors":"Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot","doi":"10.1007/s10878-024-01144-8","DOIUrl":null,"url":null,"abstract":"<p>We investigate the ratio <span>\\(\\mathcal {I}(G)\\)</span> of the average size of a maximal matching to the size of a maximum matching in a graph <i>G</i>. If many maximal matchings have a size close to <span>\\(\\nu (G)\\)</span>, this graph invariant has a value close to 1. Conversely, if many maximal matchings have a small size, <span>\\(\\mathcal {I}(G)\\)</span> approaches <span>\\(\\frac{1}{2}\\)</span>. We propose a general technique to determine the asymptotic behavior of <span>\\(\\mathcal {I}(G)\\)</span> for various classes of graphs. To illustrate the use of this technique, we first show how it makes it possible to find known asymptotic values of <span>\\(\\mathcal {I}(G)\\)</span> which were typically obtained using generating functions, and we then determine the asymptotic value of <span>\\(\\mathcal {I}(G)\\)</span> for other families of graphs, highlighting the spectrum of possible values of this graph invariant between <span>\\(\\frac{1}{2}\\)</span> and 1.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The average size of maximal matchings in graphs\",\"authors\":\"Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot\",\"doi\":\"10.1007/s10878-024-01144-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We investigate the ratio <span>\\\\(\\\\mathcal {I}(G)\\\\)</span> of the average size of a maximal matching to the size of a maximum matching in a graph <i>G</i>. If many maximal matchings have a size close to <span>\\\\(\\\\nu (G)\\\\)</span>, this graph invariant has a value close to 1. Conversely, if many maximal matchings have a small size, <span>\\\\(\\\\mathcal {I}(G)\\\\)</span> approaches <span>\\\\(\\\\frac{1}{2}\\\\)</span>. We propose a general technique to determine the asymptotic behavior of <span>\\\\(\\\\mathcal {I}(G)\\\\)</span> for various classes of graphs. To illustrate the use of this technique, we first show how it makes it possible to find known asymptotic values of <span>\\\\(\\\\mathcal {I}(G)\\\\)</span> which were typically obtained using generating functions, and we then determine the asymptotic value of <span>\\\\(\\\\mathcal {I}(G)\\\\)</span> for other families of graphs, highlighting the spectrum of possible values of this graph invariant between <span>\\\\(\\\\frac{1}{2}\\\\)</span> and 1.</p>\",\"PeriodicalId\":50231,\"journal\":{\"name\":\"Journal of Combinatorial Optimization\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10878-024-01144-8\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-024-01144-8","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

我们研究了图 G 中最大匹配的平均大小与最大匹配的大小之比 \(\mathcal{I}(G)\)。如果许多最大匹配的大小接近 \(\nu(G)\),那么这个图不变式的值就接近 1。相反,如果许多最大匹配的大小很小,那么(\mathcal {I}(G)\) 接近(\frac{1}{2}\)。我们提出了一种通用技术来确定各种图类的\(\mathcal {I}(G)\) 的渐近行为。为了说明这一技术的使用,我们首先展示了它是如何使我们找到已知的 \(\mathcal {I}(G)\) 的渐近值成为可能的,这些值通常是通过生成函数得到的,然后我们确定了 \(\mathcal {I}(G)\) 对于其他图形族的渐近值,强调了这个图形不变式的可能值在\(\frac{1}{2}\) 和 1 之间的频谱。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

The average size of maximal matchings in graphs

The average size of maximal matchings in graphs

We investigate the ratio \(\mathcal {I}(G)\) of the average size of a maximal matching to the size of a maximum matching in a graph G. If many maximal matchings have a size close to \(\nu (G)\), this graph invariant has a value close to 1. Conversely, if many maximal matchings have a small size, \(\mathcal {I}(G)\) approaches \(\frac{1}{2}\). We propose a general technique to determine the asymptotic behavior of \(\mathcal {I}(G)\) for various classes of graphs. To illustrate the use of this technique, we first show how it makes it possible to find known asymptotic values of \(\mathcal {I}(G)\) which were typically obtained using generating functions, and we then determine the asymptotic value of \(\mathcal {I}(G)\) for other families of graphs, highlighting the spectrum of possible values of this graph invariant between \(\frac{1}{2}\) and 1.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization 数学-计算机:跨学科应用
CiteScore
2.00
自引率
10.00%
发文量
83
审稿时长
6 months
期刊介绍: The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
×
引用
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学术官方微信