Several problems in combinatorics and in graph theory, known as reconstruction problems, are special cases of the following general problem: Problem 1.1.
Abstract. A general technique for tackling various reconstruction problems is presented and applied to some old and some new instances of such problems.
Aug 29, 2022 · A realization of the shuffle is a symmetric n×n matrix M whose shuffle S(M) is constructed as in A combinatorial matrix reconstruction problem ...
People also ask
What are the common combinatorial optimization problems?
What is the Reconstruction problem in graph theory?
Combinatorial reconstruction problems — Princeton University
collaborate.princeton.edu › publications
A general technique for tackling various reconstruction problems is presented and applied to some old and some new instances of such problems.
The reconstruction conjecture in graph theory says that graphs are determined uniquely by their subgraphs.
The degree sequence reconstruction problem can have multiple solutions; different graphs can correspond to the same degree sequence. In bipartite graphs, the ...
Feb 22, 2024 · This translation from classical reconstruction problems to categorical reconstruction problems shows that our framework is sufficiently general.
Jan 1, 2024 · The reconstruction conjecture states that the multiset of unlabeled vertex-deleted sub- graphs of a graph determines the graph, provided it has ...
Book details · Print length. 95 pages · Language. English · Publisher. Shaker Verlag GmbH, Germany · Publication date. June 10, 2002 · ISBN-10. 3832202714.
We 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.