Reconstructing infinite sets of integers

DOI10.1006/jcta.2002.3271zbMath1007.05073OpenAlexW2074918462MaRDI QIDQ696913

Eberhard Triesch, Dieter Rautenbach

Publication date: 12 September 2002

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.2002.3271

zbMATH Keywords

reconstructionintegers

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• A congruence theorem for trees
• Combinatorial reconstruction problems
• The \(k\)-orbit reconstruction and the orbit algebra
• Reconstructing subsets of \(\mathbb{Z}_n\)
• The \(k\)-orbit reconstruction for Abelian and Hamiltonian groups
• Reconstructing subsets of reals
• On Kelly's lemma for infinite sets of integers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstructing infinite sets of integers