Decomposing almost complete graphs by random trees

DOI10.1016/j.endm.2014.08.024zbMath1338.05216arXiv1512.00427OpenAlexW2964161030MaRDI QIDQ5890651

Anna S. Lladó

Publication date: 13 May 2016

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.00427

zbMATH Keywords

graph decompositionsRingel conjecture

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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
• A dynamic survey of graph labeling
• Additive Latin transversals.
• Packing and decomposition of graphs with trees
• \(\rho\)-valuations for some stunted trees
• Edge-decompositions ofK_n,ninto isomorphic copies of a given tree
• 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 K_2m,2m

This page was built for publication: Decomposing almost complete graphs by random trees