Combinatorial reconstruction problems

DOI10.1016/0095-8956(89)90016-6MaRDI QIDQ1095932zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0095-8956(89)90016-6

zbMATH Keywords

graphshypergraphsnull t-designsreconstruction problems

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65)

Review text

A general technique for tackling reconstruction problems is presented and applied to some old and some new instances of such problems. In particular it is shown that every polygon wih \(m>8\) vertices in the plane is determined, up to isometry, by the set of isometry types of its vertex deleted subpolygons.

Recommendations

• scientific article; zbMATH DE number 970793
• On some reconstruction problems
• scientific article; zbMATH DE number 4016946
• On a reconstruction problem for sequences
• Reconstructing convex permutominoes
• On a reconstruction problem
• On Reconstructing Graphs and Their Complements

Cites work

• A note on the line reconstruction problem
• An extremal problem for Graham-Rothschild parameter words
• Balance equations for reconstruction problems
• scientific article; zbMATH DE number 4068923 (Why is no real title available?)
• scientific article; zbMATH DE number 4073026 (Why is no real title available?)
• scientific article; zbMATH DE number 3674136 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3258862 (Why is no real title available?)
• scientific article; zbMATH DE number 3032896 (Why is no real title available?)
• On Sets of Distances of n Points
• On the number of sets in a null t-design
• On the reconstruction of a graph from its closure function
• Reconstructing graphs from their k-edge deleted subgraphs
• The edge reconstruction hypothesis is true for graphs with more than n log n edges

Cited in

(23)

• The k-orbit reconstruction and the orbit algebra
• Reconstructing subsets of \(\mathbb{Z}_n\)
• On a reconstruction problem
• Kernels of modular inclusion maps
• Reconstruction of the path graph
• The combinatorial \(k\)-deck
• On a reconstruction problem of Harary and Manvel
• Finite-type invariants for graphs and graph reconstructions
• ON THE MATABILITY OF POLYGONS
• scientific article; zbMATH DE number 4062601 (Why is no real title available?)
• Set reconstruction on the hypercube
• Graph reconstruction from path correlation data
• A survey on edge reconstruction of graphs
• scientific article; zbMATH DE number 887768 (Why is no real title available?)
• Switching reconstruction of digraphs
• Reconstructing finite sets of points in \(R^n\) up to groups of isometries
• Shotgun reconstruction in the hypercube
• Graphs isomorphisms under edge-replacements and the family of amoebas
• A polygon is determined by its angles
• Reconstructing a point set from a random subset of its pairwise distances
• Reconstructing infinite sets of integers
• Reconstructing random pictures
• Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture

This page was built for publication: Combinatorial reconstruction problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095932)