Decomposing almost complete graphs by random trees
From MaRDI portal
Publication:5915750
DOI10.1016/j.jcta.2017.09.008zbMath1373.05150OpenAlexW2757618505MaRDI QIDQ5915750
Publication date: 9 November 2017
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/117218
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Cites Work
- Unnamed Item
- An approximate version of the tree packing conjecture
- Packing minor-closed families of graphs into complete graphs
- The shape of unlabeled rooted random trees
- Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
- On a conjecture of Graham and Häggkvist with the polynomial method
- The distribution of degrees in a large random tree
- New families of graphs that have \(\alpha\)-labelings
- Additive Latin transversals.
- Packing and decomposition of graphs with trees
- \(\rho\)-valuations for some stunted trees
- Random Trees
- Combinatorial Nullstellensatz
- The distribution of nodes of given degree in random trees
- Distinct Sums Modulo n and Tree Embeddings
- Almost Every Tree With m Edges Decomposes K2m,2m
This page was built for publication: Decomposing almost complete graphs by random trees