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

Full description

Saved in:
Bibliographic Details
Main Authors: Girao, Antonio (Author) , Janzer, Oliver (Author)
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
Get full text
Author Notes:António Girão and Oliver Janzer
Search Result 1

Tiling with monochromatic bipartite graphs of bounded maximum degree by Girao, Antonio (Author) , Janzer, Oliver (Author) ,


Get full text
Article (Journal) Online Resource