Rainbow subdivisions of cliques-Reference-Cited by-同舟云学术

Rainbow subdivisions of cliques

Published:2023-10-25 Issue: Volume: Page:
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct Algorithms

Author:

Jiang Tao¹,Letzter Shoham²,Methuku Abhishek³,Yepremyan Liana⁴

Affiliation:

1. Department of Mathematics Miami University Oxford Ohio USA

2. Department of Mathematics University College London London UK

3. School of Mathematics University of Birmingham Birmingham UK

4. Deparment of Mathematics Emory University Atlanta Georgia USA

Abstract

AbstractWe 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.

Funder

National Science Foundation of Sri Lanka

Royal Society

Engineering and Physical Sciences Research Council

NSF

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/rsa.21186

Reference18 articles.

1. Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs

2. Rainbow Turán problem for even cycles

3. Rainbow Turán number of even cycles, repeated patterns and blow‐ups of cycles;Janzer O.;Israel J. Math,2023

4. O.JanzerandB.Sudakov.On the Turán number of the hypercube. arXiv:2211.020152022.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Extremal Number of Cycles with All Diagonals;International Mathematics Research Notices;2024-04-18

2. Cycles with many chords;Random Structures & Algorithms;2024-01-10