Rainbow stackings of random edge-colorings

IF 0.9 3区数学 Q2 MATHEMATICS

Bulletin of the London Mathematical Society Pub Date : 2025-03-13 DOI:10.1112/blms.70052

Noga Alon, Colin Defant, Noah Kravitz

{"title":"Rainbow stackings of random edge-colorings","authors":"Noga Alon, Colin Defant, Noah Kravitz","doi":"10.1112/blms.70052","DOIUrl":null,"url":null,"abstract":"A rainbow stacking of <math>\n <semantics>\n <mi>r</mi>\n <annotation>$r$</annotation>\n </semantics></math>-edge-colorings <math>\n <semantics>\n <mrow>\n <msub>\n <mi>χ</mi>\n <mn>1</mn>\n </msub>\n <mo>,</mo>\n <mtext>…</mtext>\n <mo>,</mo>\n <msub>\n <mi>χ</mi>\n <mi>m</mi>\n </msub>\n </mrow>\n <annotation>$\\chi _1, \\ldots , \\chi _m$</annotation>\n </semantics></math> of the complete graph on <math>\n <semantics>\n <mi>n</mi>\n <annotation>$n$</annotation>\n </semantics></math> vertices is a way of superimposing <math>\n <semantics>\n <mrow>\n <msub>\n <mi>χ</mi>\n <mn>1</mn>\n </msub>\n <mo>,</mo>\n <mtext>…</mtext>\n <mo>,</mo>\n <msub>\n <mi>χ</mi>\n <mi>m</mi>\n </msub>\n </mrow>\n <annotation>$\\chi _1, \\ldots , \\chi _m$</annotation>\n </semantics></math> so that no edges of the same color are superimposed on each other. We determine a sharp threshold for <math>\n <semantics>\n <mi>r</mi>\n <annotation>$r$</annotation>\n </semantics></math> (as a function of <math>\n <semantics>\n <mi>m</mi>\n <annotation>$m$</annotation>\n </semantics></math> and <math>\n <semantics>\n <mi>n</mi>\n <annotation>$n$</annotation>\n </semantics></math>) governing the existence and nonexistence of rainbow stackings of random <math>\n <semantics>\n <mi>r</mi>\n <annotation>$r$</annotation>\n </semantics></math>-edge-colorings <math>\n <semantics>\n <mrow>\n <msub>\n <mi>χ</mi>\n <mn>1</mn>\n </msub>\n <mo>,</mo>\n <mtext>…</mtext>\n <mo>,</mo>\n <msub>\n <mi>χ</mi>\n <mi>m</mi>\n </msub>\n </mrow>\n <annotation>$\\chi _1,\\ldots ,\\chi _m$</annotation>\n </semantics></math>.","PeriodicalId":55298,"journal":{"name":"Bulletin of the London Mathematical Society","volume":"57 6","pages":"1656-1670"},"PeriodicalIF":0.9000,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of the London Mathematical Society","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1112/blms.70052","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

Abstract

A rainbow stacking of $r$ -edge-colorings $χ_{1}, …, χ_{m}$ of the complete graph on $n$ vertices is a way of superimposing $χ_{1}, …, χ_{m}$ so that no edges of the same color are superimposed on each other. We determine a sharp threshold for $r$ (as a function of $m$ and $n$ ) governing the existence and nonexistence of rainbow stackings of random $r$ -edge-colorings $χ_{1}, …, χ_{m}$ .

查看原文本刊更多论文

随机边缘颜色的彩虹堆叠

r$ r$ -边颜色的彩虹堆叠χ 1，…，χ m $\chi _1, \ldots，n$ n$顶点上的完全图的\chi _m$是一种叠加χ 1，…，χ m$ \chi _1, \ldots，\chi _m$，以便没有相同颜色的边缘相互重叠。我们确定了r$ r$的一个尖锐阈值（作为m$ m$和n$ n$的函数）来控制随机r$ r$ -边着色χ 1的彩虹堆叠的存在性和不存在性， χ m$ \chi _1,\ldots,\chi _m$。

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

求助全文

约1分钟内获得全文求助全文

来源期刊