正则图的近似路径分解

IF 1.2 2区数学 Q1 MATHEMATICS

Journal of the London Mathematical Society-Second Series Pub Date : 2025-08-18 DOI:10.1112/jlms.70269

Richard Montgomery, Alp Müyesser, Alexey Pokrovskiy, Benny Sudakov

{"title":"正则图的近似路径分解","authors":"Richard Montgomery, Alp Müyesser, Alexey Pokrovskiy, Benny Sudakov","doi":"10.1112/jlms.70269","DOIUrl":null,"url":null,"abstract":"We show that the edges of any <math>\n <semantics>\n <mi>d</mi>\n <annotation>$d$</annotation>\n </semantics></math>-regular graph can be almost decomposed into paths of length roughly <math>\n <semantics>\n <mi>d</mi>\n <annotation>$d$</annotation>\n </semantics></math>, giving an approximate solution to a problem of Kotzig from 1957. Along the way, we show that almost all of the vertices of a <math>\n <semantics>\n <mi>d</mi>\n <annotation>$d$</annotation>\n </semantics></math>-regular graph can be partitioned into <math>\n <semantics>\n <mrow>\n <mi>n</mi>\n <mo>/</mo>\n <mo>(</mo>\n <mi>d</mi>\n <mo>+</mo>\n <mn>1</mn>\n <mo>)</mo>\n </mrow>\n <annotation>$n/(d+1)$</annotation>\n </semantics></math> paths, asymptotically confirming a conjecture of Magnant and Martin from 2009.","PeriodicalId":49989,"journal":{"name":"Journal of the London Mathematical Society-Second Series","volume":"112 2","pages":""},"PeriodicalIF":1.2000,"publicationDate":"2025-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://londmathsoc.onlinelibrary.wiley.com/doi/epdf/10.1112/jlms.70269","citationCount":"0","resultStr":"{\"title\":\"Approximate path decompositions of regular graphs\",\"authors\":\"Richard Montgomery, Alp Müyesser, Alexey Pokrovskiy, Benny Sudakov\",\"doi\":\"10.1112/jlms.70269\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that the edges of any <math>\\n <semantics>\\n <mi>d</mi>\\n <annotation>$d$</annotation>\\n </semantics></math>-regular graph can be almost decomposed into paths of length roughly <math>\\n <semantics>\\n <mi>d</mi>\\n <annotation>$d$</annotation>\\n </semantics></math>, giving an approximate solution to a problem of Kotzig from 1957. Along the way, we show that almost all of the vertices of a <math>\\n <semantics>\\n <mi>d</mi>\\n <annotation>$d$</annotation>\\n </semantics></math>-regular graph can be partitioned into <math>\\n <semantics>\\n <mrow>\\n <mi>n</mi>\\n <mo>/</mo>\\n <mo>(</mo>\\n <mi>d</mi>\\n <mo>+</mo>\\n <mn>1</mn>\\n <mo>)</mo>\\n </mrow>\\n <annotation>$n/(d+1)$</annotation>\\n </semantics></math> paths, asymptotically confirming a conjecture of Magnant and Martin from 2009.\",\"PeriodicalId\":49989,\"journal\":{\"name\":\"Journal of the London Mathematical Society-Second Series\",\"volume\":\"112 2\",\"pages\":\"\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2025-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://londmathsoc.onlinelibrary.wiley.com/doi/epdf/10.1112/jlms.70269\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the London Mathematical Society-Second Series\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://londmathsoc.onlinelibrary.wiley.com/doi/10.1112/jlms.70269\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the London Mathematical Society-Second Series","FirstCategoryId":"100","ListUrlMain":"https://londmathsoc.onlinelibrary.wiley.com/doi/10.1112/jlms.70269","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

我们证明了任意d$ d$正则图的边几乎可以分解成长度大致为d$ d$的路径，并给出了1957年Kotzig问题的近似解。在此过程中，我们证明了d$ d$正则图的几乎所有顶点都可以划分为n/(d+1)$ n/(d+1)$路径，渐近地证实了Magnant和Martin从2009年提出的一个猜想。

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

Approximate path decompositions of regular graphs

查看原文本刊更多论文

Approximate path decompositions of regular graphs

We show that the edges of any $d$ -regular graph can be almost decomposed into paths of length roughly $d$ , giving an approximate solution to a problem of Kotzig from 1957. Along the way, we show that almost all of the vertices of a $d$ -regular graph can be partitioned into $n / (d + 1)$ paths, asymptotically confirming a conjecture of Magnant and Martin from 2009.

求助全文

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

来源期刊

Journal of the London Mathematical Society-Second Series 数学-数学

CiteScore

1.90

自引率

0.00%

发文量

186

审稿时长

6-12 weeks

期刊介绍： The Journal of the London Mathematical Society has been publishing leading research in a broad range of mathematical subject areas since 1926. The Journal welcomes papers on subjects of general interest that represent a significant advance in mathematical knowledge, as well as submissions that are deemed to stimulate new interest and research activity.