Linearly many rainbow trees in properly edge-coloured complete graphs

DOI10.1016/j.jctb.2018.03.005zbMath1391.05116arXiv1703.07301OpenAlexW2609209176WikidataQ130069422 ScholiaQ130069422MaRDI QIDQ723883

Alexey Pokrovskiy, Benjamin Sudakov

Publication date: 24 July 2018

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.07301

zbMATH Keywords

graph decompositionsproper edge-colouringsrainbow trees

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (14)

Almost all optimally coloured complete graphs contain a rainbow Hamilton path ⋮ Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs ⋮ Unnamed Item ⋮ On the complexity of packing rainbow spanning trees ⋮ Quaternionic 1-factorizations and complete sets of rainbow spanning trees ⋮ Color Isomorphic Even Cycles and a Related Ramsey Problem ⋮ A rainbow blow‐up lemma ⋮ Rainbow structures in locally bounded colorings of graphs ⋮ Unnamed Item ⋮ Decompositions into isomorphic rainbow spanning trees ⋮ Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations ⋮ Repeated Patterns in Proper Colorings ⋮ An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles ⋮ $(g,f)$-Chromatic spanning trees and forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Multicolored Isomorphic Spanning Trees in Complete Graphs
• Rainbow spanning trees in complete graphs colored by one‐factorizations
• Kotzig Factorizations: Existence and Computational Results
• Multicolored Parallelisms of Isomorphic Spanning Trees
• A Combinatorial Theorem
• Properly colored and rainbow copies of graphs with few cherries
• Multicolored trees in complete graphs
• Multicolored trees in complete graphs

This page was built for publication: Linearly many rainbow trees in properly edge-coloured complete graphs