Distinct Sums Modulo n and Tree Embeddings

DOI10.1017/S0963548301004874zbMath0997.05029OpenAlexW2037794774MaRDI QIDQ4330733

Hunter S. Snevily, André E. Kézdy

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

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

Related Items (10)

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

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