Edge-disjoint rainbow trees in properly coloured complete graphs

DOI10.1016/j.endm.2017.07.064zbMath1378.05071OpenAlexW2742721051MaRDI QIDQ1690046

Alexey Pokrovskiy, Benjamin Sudakov

Publication date: 18 January 2018

Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10112656/

zbMATH Keywords

Brualdi-Hollingsworth conjectureConstantine's conjectureedge-coloured complete graphKaneko-Kano-Suzuki conjecture

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

On the number of rainbow spanning trees in edge-colored complete graphs ⋮ Rainbow spanning trees in properly coloured complete graphs ⋮ Edge-disjoint rainbow trees in properly coloured complete graphs ⋮ Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees

Cites Work

• Edge-disjoint rainbow spanning trees in complete graphs
• On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)
• Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
• Edge-disjoint rainbow trees in properly coloured complete graphs
• Kotzig Factorizations: Existence and Computational Results
• Multicolored Parallelisms of Isomorphic Spanning Trees
• Multicolored trees in complete graphs
• Multicolored trees in complete graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-disjoint rainbow trees in properly coloured complete graphs