A family of non-reconstructible hypergraphs (Q1066163)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A family of non-reconstructible hypergraphs |
scientific article; zbMATH DE number 3924833
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A family of non-reconstructible hypergraphs |
scientific article; zbMATH DE number 3924833 |
Statements
A family of non-reconstructible hypergraphs (English)
0 references
1987
0 references
A \(k\)-hypergraph is a hypergraph in which each edge contains \(k\) vertices. We describe the construction of an infinite family of finite, non- reconstructible 3-hypergraphs. We also indicate why the same techniques can likely be used to construct non-reconstructible \(k\)-hypergraphs for any \(k\geq 3\).
0 references
hypergraph
0 references
non-reconstructability
0 references
reconstruction conjecture
0 references
hypomorphism
0 references
