无冲突超图匹配

IF 16.4 1区化学 Q1 CHEMISTRY, MULTIDISCIPLINARY

Accounts of Chemical Research Pub Date : 2024-04-29 DOI:10.1112/jlms.12899

Stefan Glock, Felix Joos, Jaehoon Kim, Marcus Kühn, Lyuben Lichev

{"title":"无冲突超图匹配","authors":"Stefan Glock, Felix Joos, Jaehoon Kim, Marcus Kühn, Lyuben Lichev","doi":"10.1112/jlms.12899","DOIUrl":null,"url":null,"abstract":"A celebrated theorem of Pippenger, and Frankl and Rödl states that every almost-regular, uniform hypergraph <math>\n <semantics>\n <mi>H</mi>\n <annotation>$\\mathcal {H}$</annotation>\n </semantics></math> with small maximum codegree has an almost-perfect matching. We extend this result by obtaining a conflict-free matching, where conflicts are encoded via a collection <math>\n <semantics>\n <mi>C</mi>\n <annotation>$\\mathcal {C}$</annotation>\n </semantics></math> of subsets <math>\n <semantics>\n <mrow>\n <mi>C</mi>\n <mo>⊆</mo>\n <mi>E</mi>\n <mo>(</mo>\n <mi>H</mi>\n <mo>)</mo>\n </mrow>\n <annotation>$C\\subseteq E(\\mathcal {H})$</annotation>\n </semantics></math>. We say that a matching <math>\n <semantics>\n <mrow>\n <mi>M</mi>\n <mo>⊆</mo>\n <mi>E</mi>\n <mo>(</mo>\n <mi>H</mi>\n <mo>)</mo>\n </mrow>\n <annotation>$\\mathcal {M}\\subseteq E(\\mathcal {H})$</annotation>\n </semantics></math> is conflict-free if <math>\n <semantics>\n <mi>M</mi>\n <annotation>$\\mathcal {M}$</annotation>\n </semantics></math> does not contain an element of <math>\n <semantics>\n <mi>C</mi>\n <annotation>$\\mathcal {C}$</annotation>\n </semantics></math> as a subset. Under natural assumptions on <math>\n <semantics>\n <mi>C</mi>\n <annotation>$\\mathcal {C}$</annotation>\n </semantics></math>, we prove that <math>\n <semantics>\n <mi>H</mi>\n <annotation>$\\mathcal {H}$</annotation>\n </semantics></math> has a conflict-free, almost-perfect matching. This has many applications, one of which yields new asymptotic results for so-called ‘high-girth’ Steiner systems. Our main tool is a random greedy algorithm which we call the ‘conflict-free matching process’.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1112/jlms.12899","citationCount":"0","resultStr":"{\"title\":\"Conflict-free hypergraph matchings\",\"authors\":\"Stefan Glock, Felix Joos, Jaehoon Kim, Marcus Kühn, Lyuben Lichev\",\"doi\":\"10.1112/jlms.12899\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A celebrated theorem of Pippenger, and Frankl and Rödl states that every almost-regular, uniform hypergraph <math>\\n <semantics>\\n <mi>H</mi>\\n <annotation>$\\\\mathcal {H}$</annotation>\\n </semantics></math> with small maximum codegree has an almost-perfect matching. We extend this result by obtaining a conflict-free matching, where conflicts are encoded via a collection <math>\\n <semantics>\\n <mi>C</mi>\\n <annotation>$\\\\mathcal {C}$</annotation>\\n </semantics></math> of subsets <math>\\n <semantics>\\n <mrow>\\n <mi>C</mi>\\n <mo>⊆</mo>\\n <mi>E</mi>\\n <mo>(</mo>\\n <mi>H</mi>\\n <mo>)</mo>\\n </mrow>\\n <annotation>$C\\\\subseteq E(\\\\mathcal {H})$</annotation>\\n </semantics></math>. We say that a matching <math>\\n <semantics>\\n <mrow>\\n <mi>M</mi>\\n <mo>⊆</mo>\\n <mi>E</mi>\\n <mo>(</mo>\\n <mi>H</mi>\\n <mo>)</mo>\\n </mrow>\\n <annotation>$\\\\mathcal {M}\\\\subseteq E(\\\\mathcal {H})$</annotation>\\n </semantics></math> is conflict-free if <math>\\n <semantics>\\n <mi>M</mi>\\n <annotation>$\\\\mathcal {M}$</annotation>\\n </semantics></math> does not contain an element of <math>\\n <semantics>\\n <mi>C</mi>\\n <annotation>$\\\\mathcal {C}$</annotation>\\n </semantics></math> as a subset. Under natural assumptions on <math>\\n <semantics>\\n <mi>C</mi>\\n <annotation>$\\\\mathcal {C}$</annotation>\\n </semantics></math>, we prove that <math>\\n <semantics>\\n <mi>H</mi>\\n <annotation>$\\\\mathcal {H}$</annotation>\\n </semantics></math> has a conflict-free, almost-perfect matching. This has many applications, one of which yields new asymptotic results for so-called ‘high-girth’ Steiner systems. Our main tool is a random greedy algorithm which we call the ‘conflict-free matching process’.\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2024-04-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1112/jlms.12899\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1112/jlms.12899\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1112/jlms.12899","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

摘要

皮彭格（Pippenger）、弗兰克尔（Frankl）和罗德尔（Rödl）的一个著名定理指出，每一个几乎不规则的、具有较小最大度数的均匀超图 H $mathcal {H}$ 都有一个几乎完美的匹配。我们通过获得无冲突匹配来扩展这一结果，其中冲突是通过子集 C ⊆ E ( H ) $C\subseteq E(\mathcal {H})$ 的集合 C $\mathcal {C}$ 来编码的。如果 M $\mathcal {M}$ 不包含作为子集的 C $\mathcal {C}$ 的元素，我们就说匹配 M ⊆ E ( H ) $\mathcal {M}\subseteq E(\mathcal {H})$ 是无冲突的。在 C $\mathcal {C}$ 的自然假设下，我们证明 H $\mathcal {H}$ 有一个无冲突的、几乎完美的匹配。这一点有很多应用，其中之一是为所谓的 "高出生 "斯坦纳系统提供了新的渐近结果。我们的主要工具是一种随机贪婪算法，我们称之为 "无冲突匹配过程"。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

Conflict-free hypergraph matchings

查看原文本刊更多论文

Conflict-free hypergraph matchings

A celebrated theorem of Pippenger, and Frankl and Rödl states that every almost-regular, uniform hypergraph $H$ with small maximum codegree has an almost-perfect matching. We extend this result by obtaining a conflict-free matching, where conflicts are encoded via a collection $C$ of subsets $C \subseteq E (H)$ . We say that a matching $M \subseteq E (H)$ is conflict-free if $M$ does not contain an element of $C$ as a subset. Under natural assumptions on $C$ , we prove that $H$ has a conflict-free, almost-perfect matching. This has many applications, one of which yields new asymptotic results for so-called ‘high-girth’ Steiner systems. Our main tool is a random greedy algorithm which we call the ‘conflict-free matching process’.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Accounts of Chemical Research 化学-化学综合

CiteScore

31.40

自引率

1.10%

发文量

312

审稿时长

2 months

期刊介绍： Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.