派系的彩虹分支

Pub Date : 2023-10-25 DOI:10.1002/rsa.21186

Tao Jiang, Shoham Letzter, Abhishek Methuku, Liana Yepremyan

{"title":"派系的彩虹分支","authors":"Tao Jiang, Shoham Letzter, Abhishek Methuku, Liana Yepremyan","doi":"10.1002/rsa.21186","DOIUrl":null,"url":null,"abstract":"Abstract We show that for every integer and large , every properly edge‐colored graph on vertices with at least edges contains a rainbow subdivision of . This is sharp up to a polylogarithmic factor. Our proof method exploits the connection between the mixing time of random walks and expansion in graphs.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Rainbow subdivisions of cliques\",\"authors\":\"Tao Jiang, Shoham Letzter, Abhishek Methuku, Liana Yepremyan\",\"doi\":\"10.1002/rsa.21186\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We show that for every integer and large , every properly edge‐colored graph on vertices with at least edges contains a rainbow subdivision of . This is sharp up to a polylogarithmic factor. Our proof method exploits the connection between the mixing time of random walks and expansion in graphs.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2023-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/rsa.21186\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/rsa.21186","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

摘要:我们证明了对于每一个整数和大的，每一个在至少有边的顶点上的适当的有边的图包含一个彩虹细分。这是一个多对数因子。我们的证明方法利用了图中随机漫步的混合时间与展开之间的联系。

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

查看原文

Rainbow subdivisions of cliques

Abstract We show that for every integer and large , every properly edge‐colored graph on vertices with at least edges contains a rainbow subdivision of . This is sharp up to a polylogarithmic factor. Our proof method exploits the connection between the mixing time of random walks and expansion in graphs.

求助全文

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