Embedding rainbow trees with applications to graph labelling and decomposition
DOI10.4171/JEMS/982MaRDI QIDQ2216732FDOQ2216732
Authors: Richard Montgomery, Alexey Pokrovskiy, Benny Sudakov 
Publication date: 17 December 2020
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.03316
Recommendations
- Linearly many rainbow trees in properly edge-coloured complete graphs
- Edge-disjoint rainbow trees in properly coloured complete graphs
- Long directed rainbow cycles and rainbow spanning trees
- Decompositions into isomorphic rainbow spanning trees
- Rainbow structures in locally bounded colorings of graphs
Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Transversals of latin squares and their generalizations
- An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
- Combinatorial matrix theory
- Title not available (Why is that?)
- A dynamic survey of graph labeling
- Optimal packings of bounded degree trees
- An approximate version of the tree packing conjecture
- Packing minor-closed families of graphs into complete graphs
- The probabilistic method
- Transversals in Latin squares: a survey
- On Additive Bases and Harmonious Graphs
- Title not available (Why is that?)
- Packing of graphs - a survey
- A Combinatorial Theorem
- Title not available (Why is that?)
- Packing spanning graphs from separable families
- Title not available (Why is that?)
- Orthogonal double covers of complete graphs by trees
- Rainbow and orthogonal paths in factorizations of \(K_n\)
- Packing trees of unbounded degrees in random graphs
- On rainbow cycles in edge colored complete graphs
- Title not available (Why is that?)
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- Hamilton circuits with many colours in properly edge-coloured complete graphs.
- On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)
- Packing of graphs and permutations -- a survey
- Title not available (Why is that?)
- On orthogonal double covers by trees
- Long rainbow cycles in proper edge-colorings of complete graphs
- Title not available (Why is that?)
- A blow-up lemma for approximate decompositions
- Packing degenerate graphs
- Long directed rainbow cycles and rainbow spanning trees
- Almost all trees are almost graceful
Cited In (23)
- The \(n\)-queens completion problem
- Recent developments on gracefulness of graphs. A survey complemented with chessboard representations
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Tree decompositions of graphs without large bipartite holes
- Embedding rainbow trees with applications to graph labelling and decomposition
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Spanning trees in dense directed graphs
- Repeated patterns in proper colorings
- Perfectly packing graphs with bounded degeneracy and many leaves
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
- The novel generally described graphs for cyclic orthogonal double covers of some circulants
- Graph and hypergraph packing
- Rainbow factors in hypergraphs
- Pseudorandom hypergraph matchings
- Resolution of the Oberwolfach problem
- A rainbow blow-up lemma
- Trees with many leaves in tournaments
- A Short proof of the blow-up lemma for approximate decompositions
- A proof of Ringel's conjecture
- Finding large rainbow trees in colourings of \(K_{n, n}\)
- Packing paths in Steiner triple systems
- Graph Tilings in Incompatibility Systems
This page was built for publication: Embedding rainbow trees with applications to graph labelling and decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2216732)
