Combinatorial reconstruction problems (Q1095932)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4029620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial reconstruction problems |
scientific article; zbMATH DE number 4029620 |
Statements
Combinatorial reconstruction problems (English)
0 references
1989
0 references
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.
0 references
graphs
0 references
hypergraphs
0 references
null t-designs
0 references
reconstruction problems
0 references
0 references
0.8764775
0 references
0 references
0 references
0.8706276
0 references
