Almost Every Tree With m Edges Decomposes K2m,2m
From MaRDI portal
Publication:5414145
DOI10.1017/S0963548313000485zbMath1287.05113OpenAlexW2098109701MaRDI QIDQ5414145
Publication date: 2 May 2014
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548313000485
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)
Related Items (4)
Decomposing almost complete graphs by random trees ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Decomposing almost complete graphs by random trees ⋮ Optimal packings of bounded degree trees
Cites Work
- 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
- The number of trees
- Edge-decompositions ofKn,ninto isomorphic copies of a given tree
- Singularity Analysis of Generating Functions
- Combinatorial Nullstellensatz
- The distribution of nodes of given degree in random trees
- Transversals of additive Latin squares
This page was built for publication: Almost Every Tree With m Edges Decomposes K2m,2m
