Tiling with monochromatic bipartite graphs of bounded maximum degree
We prove that for any r∈N, there exists a constant Cr such that the following is true. Let F={F1,F2,…} be an infinite sequence of bipartite graphs such that |V(Fi)|=i and Δ(Fi)≤Δ hold for all i. Then in any r-edge coloured complete graph Kn, there is a collection of at most exp(CrΔ) monochromatic su...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article (Journal) Chapter/Article |
| Language: | English |
| Published: |
20 Sep 2021
|
| In: |
Arxiv
Year: 2021, Pages: 1-18 |
| DOI: | 10.48550/arXiv.2109.09642 |
| Online Access: | Verlag, kostenfrei, Volltext: https://doi.org/10.48550/arXiv.2109.09642 Verlag, kostenfrei, Volltext: http://arxiv.org/abs/2109.09642 
|
| Author Notes: | António Girão and Oliver Janzer |
| Summary: | We prove that for any r∈N, there exists a constant Cr such that the following is true. Let F={F1,F2,…} be an infinite sequence of bipartite graphs such that |V(Fi)|=i and Δ(Fi)≤Δ hold for all i. Then in any r-edge coloured complete graph Kn, there is a collection of at most exp(CrΔ) monochromatic subgraphs, each of which is isomorphic to an element of F, whose vertex sets partition V(Kn). This proves a conjecture of Corsten and Mendonça in a strong form and generalizes results on the multicolour Ramsey numbers of bounded-degree bipartite graphs. |
|---|---|
| Item Description: | Gesehen am 09.01.2024 |
| Physical Description: | Online Resource |
| DOI: | 10.48550/arXiv.2109.09642 |