Embedding rainbow trees with applications to graph labelling and decomposition
From MaRDI portal
(Redirected from Publication:2216732)
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)
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
Cites work
- scientific article; zbMATH DE number 6473829 (Why is no real title available?)
- scientific article; zbMATH DE number 3650571 (Why is no real title available?)
- scientific article; zbMATH DE number 53885 (Why is no real title available?)
- scientific article; zbMATH DE number 3604921 (Why is no real title available?)
- scientific article; zbMATH DE number 3613053 (Why is no real title available?)
- scientific article; zbMATH DE number 3258069 (Why is no real title available?)
- scientific article; zbMATH DE number 3308125 (Why is no real title available?)
- A Combinatorial Theorem
- A blow-up lemma for approximate decompositions
- A dynamic survey of graph labeling
- Almost all trees are almost graceful
- An n n Latin square has a transversal with at least n- n distinct symbols
- An approximate version of the tree packing conjecture
- Combinatorial matrix theory
- Hamilton circuits with many colours in properly edge-coloured complete graphs.
- Long directed rainbow cycles and rainbow spanning trees
- Long rainbow cycles in proper edge-colorings of complete graphs
- On Additive Bases and Harmonious Graphs
- On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\)
- On orthogonal double covers by trees
- On rainbow cycles in edge colored complete graphs
- Optimal packings of bounded degree trees
- Orthogonal double covers of complete graphs by trees
- Packing degenerate graphs
- Packing minor-closed families of graphs into complete graphs
- Packing of graphs - a survey
- Packing of graphs and permutations -- a survey
- Packing spanning graphs from separable families
- Packing trees of unbounded degrees in random graphs
- Rainbow and orthogonal paths in factorizations of \(K_n\)
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- The probabilistic method
- Transversals in Latin squares: a survey
- Transversals of latin squares and their generalizations
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
- 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
- Rainbow factors in hypergraphs
- Graph and hypergraph packing
- Pseudorandom hypergraph matchings
- Resolution of the Oberwolfach problem
- Embedding rainbow trees with applications to graph labelling and decomposition
- 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)
