Add to ORKGWe prove that every finite subset of the plane is reconstructible from the multiset of its subsets of at most 18 points, each given up to rigid motion. We also give some results concerning the reconstructibility of infinite subsets of the plane
AbstractBrylawski first raised the questions of whether a matroid can be reconstructed from its mult...
AbstractFor every cardinal α > ℵD there exists an α regular graph which is reconstructible but not e...
A graph is reconstructible if it is determined up to isomorphism from the collection of all its one-...
We prove that every finite subset of the plane is reconstructible from the multiset of its subsets o...
We consider the problem of reconstructing a set of real numbers up to translation from the multiset ...
We consider the problem of reconstructing a set of real numbers up to translation from the multiset ...
AbstractWe give a complete answer to a question raised by Harary and Manvel in 1972 (Bull. Soc. Math...
Partially supported by NSF Grant DMS-9401351 In this paper we consider the problem of reconstructing...
AbstractLet G be an infinite locally finite connected graph. We study the reconstructibility of G in...
The edge reconstruction conjecture of Harary (1964) states that a finite graph G can be reconstructe...
Set reconstruction on the hypercube, Discrete Analysis 2017:17, 10 pp. A well-known open problem in...
AbstractIn this paper we consider the problem of reconstructing a subsetA⊂Zn, up to translation, fro...
AbstractFor some finite set A of points in Rn and some integer k∈N we consider the problem of recons...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
AbstractA general technique for tackling various reconstruction problems is presented and applied to...
AbstractBrylawski first raised the questions of whether a matroid can be reconstructed from its mult...
AbstractFor every cardinal α > ℵD there exists an α regular graph which is reconstructible but not e...
A graph is reconstructible if it is determined up to isomorphism from the collection of all its one-...
We prove that every finite subset of the plane is reconstructible from the multiset of its subsets o...
We consider the problem of reconstructing a set of real numbers up to translation from the multiset ...
We consider the problem of reconstructing a set of real numbers up to translation from the multiset ...
AbstractWe give a complete answer to a question raised by Harary and Manvel in 1972 (Bull. Soc. Math...
Partially supported by NSF Grant DMS-9401351 In this paper we consider the problem of reconstructing...
AbstractLet G be an infinite locally finite connected graph. We study the reconstructibility of G in...
The edge reconstruction conjecture of Harary (1964) states that a finite graph G can be reconstructe...
Set reconstruction on the hypercube, Discrete Analysis 2017:17, 10 pp. A well-known open problem in...
AbstractIn this paper we consider the problem of reconstructing a subsetA⊂Zn, up to translation, fro...
AbstractFor some finite set A of points in Rn and some integer k∈N we consider the problem of recons...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
AbstractA general technique for tackling various reconstruction problems is presented and applied to...
AbstractBrylawski first raised the questions of whether a matroid can be reconstructed from its mult...
AbstractFor every cardinal α > ℵD there exists an α regular graph which is reconstructible but not e...
A graph is reconstructible if it is determined up to isomorphism from the collection of all its one-...