Distinct Sums Modulo n and Tree Embeddings

DOI10.1017/S0963548301004874MaRDI QIDQ4330733zbMATH OpenOpenAlexFDO

Authors André E. Kézdy, Hunter Snevily

Publication date 14 May 2002

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548301004874

zbMATH Keywords

permutationtree embeddings

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A proof of Ringel's conjecture
• Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
• scientific article; zbMATH DE number 3863220
• Packing trees of bounded diameter into the complete graph
• On the tree packing conjecture

Cited in

(11)

• 0-centred and 0-ubiquitously graceful trees.
• Signed Langford sequences
• On various restricted sumsets
• Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)
• Edge-decompositions ofK_n,ninto isomorphic copies of a given tree
• On a permutation problem for finite abelian groups
• Decomposing almost complete graphs by random trees
• Decomposing almost complete graphs by random trees
• A random Hall-Paige conjecture
• \(\alpha\)-labeling number of trees
• Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)

This page was built for publication: Distinct Sums Modulo n and Tree Embeddings

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