Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)

DOI10.1016/j.disc.2009.09.021zbMath1208.05013OpenAlexW2091970724MaRDI QIDQ965963

Anna S. Lladó, Susana-Clara López, Jordi Moragas

Publication date: 27 April 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.09.021

zbMATH Keywords

combinatorial nullstellensatzgraph decompositionsgraph labelings

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

Decomposing almost complete graphs by random trees ⋮ Decomposing almost complete graphs by random trees ⋮ Approximate results for rainbow labelings ⋮ Almost Every Tree With m Edges Decomposes K_2m,2m ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a conjecture of Graham and Häggkvist with the polynomial method
• A dynamic survey of graph labeling
• Additive Latin transversals.
• \(\rho\)-valuations for some stunted trees
• Edge-decompositions ofK_n,ninto isomorphic copies of a given tree
• Combinatorial Nullstellensatz
• Distinct Sums Modulo n and Tree Embeddings
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Relaxed graceful labellings of trees

This page was built for publication: Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)