Embedding rainbow trees with applications to graph labelling and decomposition
From MaRDI portal
Publication:6298823
DOI10.4171/JEMS/982zbMath1508.05024arXiv1803.03316MaRDI QIDQ6298823
Alexey Pokrovskiy, Benjamin Sudakov, Richard Montgomery
Publication date: 8 March 2018
Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
This page was built for publication: Embedding rainbow trees with applications to graph labelling and decomposition