AbstractFor some finite set A of points in Rn and some integer k∈N we consider the problem of reconstructing the set A up to isometry from the multiset of the (|A|k) subsets of A of cardinality k given up to isometry. We prove the best possible result for n=1 and settle an open problem for n=2 mentioned by Krasikov and Roditty in (Ars Combin. 25B (1988) 211–219)
AbstractGiven two finite subsets A, B of Rk (of Ck) we test in time (ek4 nl)O(1) whether there exist...
AbstractOne of the central problems of extremal hypergraph theory is the description of unavoidable ...
AbstractWe prove best-possible upper and lower bounds on the number of matchings in a tree in terms ...
AbstractFor some finite set A of points in Rn and some integer k∈N we consider the problem of recons...
AbstractWe give a complete answer to a question raised by Harary and Manvel in 1972 (Bull. Soc. Math...
We consider the problem of reconstructing a set of real numbers up to translation from the multiset ...
AbstractFor a set of integers A⊆Z and k⩾1 the k-deck of A is the function dA,k defined on sets S of ...
AbstractIn this paper we consider the problem of reconstructing a subsetA⊂Zn, up to translation, fro...
Set reconstruction on the hypercube, Discrete Analysis 2017:17, 10 pp. A well-known open problem in...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
Three isomorphic vector spaces Bk/N , Ck/N and Dk/N are defined. The interplay of these vector space...
AbstractFor a finite multigraph G, let Λ(G) denote the lattice of integer flows of G – this is a fin...
AbstractThree isomorphic vector spaces BNk,CNk and DNk are defined. The interplay of these vector sp...
AbstractLet R⊆ω×ω be an arithemetic relation. We show that (∀x)(ϵ)R(x,y) holds in the arithemetic is...
We prove that every finite subset of the plane is reconstructible from the multiset of its subsets o...
AbstractGiven two finite subsets A, B of Rk (of Ck) we test in time (ek4 nl)O(1) whether there exist...
AbstractOne of the central problems of extremal hypergraph theory is the description of unavoidable ...
AbstractWe prove best-possible upper and lower bounds on the number of matchings in a tree in terms ...
AbstractFor some finite set A of points in Rn and some integer k∈N we consider the problem of recons...
AbstractWe give a complete answer to a question raised by Harary and Manvel in 1972 (Bull. Soc. Math...
We consider the problem of reconstructing a set of real numbers up to translation from the multiset ...
AbstractFor a set of integers A⊆Z and k⩾1 the k-deck of A is the function dA,k defined on sets S of ...
AbstractIn this paper we consider the problem of reconstructing a subsetA⊂Zn, up to translation, fro...
Set reconstruction on the hypercube, Discrete Analysis 2017:17, 10 pp. A well-known open problem in...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
Three isomorphic vector spaces Bk/N , Ck/N and Dk/N are defined. The interplay of these vector space...
AbstractFor a finite multigraph G, let Λ(G) denote the lattice of integer flows of G – this is a fin...
AbstractThree isomorphic vector spaces BNk,CNk and DNk are defined. The interplay of these vector sp...
AbstractLet R⊆ω×ω be an arithemetic relation. We show that (∀x)(ϵ)R(x,y) holds in the arithemetic is...
We prove that every finite subset of the plane is reconstructible from the multiset of its subsets o...
AbstractGiven two finite subsets A, B of Rk (of Ck) we test in time (ek4 nl)O(1) whether there exist...
AbstractOne of the central problems of extremal hypergraph theory is the description of unavoidable ...
AbstractWe prove best-possible upper and lower bounds on the number of matchings in a tree in terms ...
DOI
Add to ORKG