Almost every tree with n edges decomposes K₂n,2n

MaRDI QIDQ2857407zbMATH OpenFDO

Authors Anna Lladó

Publication date 1 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065311001624

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Almost every tree with \(m\) edges decomposes \(K_{2m,2m}\)
• Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs
• Edge-decompositions ofK_n,ninto isomorphic copies of a given tree
• scientific article; zbMATH DE number 4168718
• Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
• scientific article; zbMATH DE number 2214509
• scientific article; zbMATH DE number 19211
• Decompositions of critical trees with cutwidth k
• Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\)
• A degree bound on decomposable trees

Cites work

• \(\rho\)-valuations for some stunted trees
• Additive Latin transversals.
• Distinct Sums Modulo n and Tree Embeddings
• Edge-decompositions ofK_n,ninto isomorphic copies of a given tree
• Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
• scientific article; zbMATH DE number 4150219 (Why is no real title available?)
• New families of graphs that have \(\alpha\)-labelings
• On a conjecture of Graham and Häggkvist with the polynomial method
• Packing and decomposition of graphs with trees
• The distribution of degrees in a large random tree
• The distribution of nodes of given degree in random trees
• Trees having an even or quasi even degree sequence are graceful

Cited in

(14)

• Packing and decomposition of graphs with trees
• Perfect matchings and \(k\)-decomposability of increasing trees
• Edge-decompositions ofK_n,ninto isomorphic copies of a given tree
• The decomposition of trees into subtrees
• scientific article; zbMATH DE number 4150219 (Why is no real title available?)
• On a Häggkvist's Conjecture with the Polynomial Method
• Problem D. Froncek and M. Kubesa
• scientific article; zbMATH DE number 19211 (Why is no real title available?)
• Tree decomposition of graphs
• Almost every tree with \(m\) edges decomposes \(K_{2m,2m}\)
• On a conjecture of Graham and Häggkvist for random trees
• On a problem of Fronček and Kubesa
• Decomposition of a complete equipartite graph into gregarious \(\mathcal{Y}_5\) tree
• Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)

This page was built for publication: Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2857407)