442 research outputs found
Edge-disjoint rainbow trees in properly coloured complete graphs
A subgraph of an edge-coloured complete graph is called rainbow if all its edges
have different colours. The study of rainbow decompositions has a long history,
going back to the work of Euler on Latin squares. We discuss three problems
about decomposing complete graphs into rainbow trees: the Brualdi-Hollingsworth
Conjecture, Constantine’s Conjecture, and the Kaneko-Kano-Suzuki Conjecture.
The main result which we discuss is that in every proper edge-colouring of Kn there
are 10−6n edge-disjoint isomorphic spanning rainbow trees. This simultaneously
improves the best known bounds on all these conjectures. Using our method it is also
possible to show that every properly (n−1)-edge-coloured Kn has n/9 edge-disjoint
spanning rainbow trees, giving a further improvement on the Brualdi-Hollingsworth
Conjectur
Linearly many rainbow trees in properly edge-coloured complete graphs
A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different
colours. The study of rainbow decompositions has a long history, going back to the work of
Euler on Latin squares. In this paper we discuss three problems about decomposing complete
graphs into rainbow trees: the Brualdi-Hollingsworth Conjecture, Constantine’s Conjecture, and
the Kaneko-Kano-Suzuki Conjecture. We show that in every proper edge-colouring of Kn there
are 10−6n edge-disjoint spanning isomorphic rainbow trees. This simultaneously improves the
best known bounds on all these conjectures. Using our method we also show that every properly
(n − 1)-edge-coloured Kn has n/9 − 6 edge-disjoint rainbow trees, giving further improvement on
the Brualdi-Hollingsworth Conjectur
Linearly many rainbow trees in properly edge-coloured complete graphs
A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different
colours. The study of rainbow decompositions has a long history, going back to the work of
Euler on Latin squares. In this paper we discuss three problems about decomposing complete
graphs into rainbow trees: the Brualdi-Hollingsworth Conjecture, Constantine’s Conjecture, and
the Kaneko-Kano-Suzuki Conjecture. We show that in every proper edge-colouring of Kn there
are 10−6n edge-disjoint spanning isomorphic rainbow trees. This simultaneously improves the
best known bounds on all these conjectures. Using our method we also show that every properly
(n − 1)-edge-coloured Kn has n/9 − 6 edge-disjoint rainbow trees, giving further improvement on
the Brualdi-Hollingsworth Conjecture
Linearly many rainbow trees in properly edge-coloured complete graphs
A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different colours. The study of rainbow decompositions has a long history, going back to the work of Euler on Latin squares. In this paper we discuss three problems about decomposing complete graphs into rainbow trees: the Brualdi-Hollingsworth Conjecture, Constantine's Conjecture, and the Kaneko-Kano-Suzuki Conjecture. We show that in every proper edge-colouring of Kn there are 10^{−6}n edge-disjoint spanning isomorphic rainbow trees. This simultaneously improves the best known bounds on all these conjectures. Using our method we also show that every properly (n−1)-edge-coloured Kn has n/9 edge-disjoint rainbow trees, giving further improvement on the Brualdi-Hollingsworth Conjecture
Decompositions into spanning rainbow structures
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.
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
- …