UCL Discovery Stage
UCL home » Library Services » Electronic resources » UCL Discovery Stage

Decompositions into spanning rainbow structures

Montgomery, R; Pokrovskiy, A; Sudakov, B; (2019) Decompositions into spanning rainbow structures. Proceedings of the London Mathematical Society , 119 (4) pp. 899-959. 10.1112/plms.12245. Green open access

[thumbnail of 1805.07564v3.pdf]
Preview
Text
1805.07564v3.pdf - Accepted Version

Download (877kB) | Preview

Abstract

A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs goes back more than two hundred years to the work of Euler on Latin squares and has been the focus of extensive research ever since. Euler posed a problem equivalent to finding properly n-edge-coloured complete bipartite graphs Kn,n which can be decomposed into rainbow perfect matchings. While there are proper edge-colourings of Kn,n without even a single rainbow perfect matching, the theme of this paper is to show that with some very weak additional constraints one can find many disjoint rainbow perfect matchings. In particular, we prove that if some fraction of the colour classes have at most (1 − o(1))n edges then one can nearly-decompose the edges of Kn,n into edge-disjoint perfect rainbow matchings. As an application of this, we establish in a very strong form a conjecture of Akbari and Alipour and asymptotically prove a conjecture of Barat and Nagy. Both these conjectures concern rainbow perfect matchings in edge-colourings of Kn,n with quadratically many colours. The above result also has implications to some conjectures of Snevily about subsquares of multiplication tables of groups. Finally, using our techniques, we also prove a number of results on near-decompositions of graphs into other rainbow structures like Hamiltonian cycles and spanning trees. Most notably, we prove that any properly coloured complete graph can be nearly-decomposed into spanning rainbow trees. This asymptotically proves the Brualdi-Hollingsworth and Kaneko-Kano-Suzuki conjectures which predict that a perfect decomposition should exist under the same assumptions.

Type: Article
Title: Decompositions into spanning rainbow structures
Open access status: An open access version is available from UCL Discovery
DOI: 10.1112/plms.12245
Publisher version: https://doi.org/10.1112/plms.12245
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
UCL classification: UCL
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Mathematics
URI: https://discovery-pp.ucl.ac.uk/id/eprint/10112643
Downloads since deposit
780Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item