A family of nonreconstructible hypergraphs
暂无分享，去创建一个
A k-hypergraph is a hypergraph in which each edge contains k vertices. We describe the construction of an infinite family of finite, nonreconstructible 3-hypergraphs. We also indicate why the same techniques can likely be used to construct nonreconstructible k-hypergraphs for any k ⩾ 3.
[1] Tom Brylawski. On the nonreconstructibility of combinatorial geometries , 1975 .
[2] Robert L. Hemminger,et al. Graph reconstruction - a survey , 1977, J. Graph Theory.
[3] Claude Berge. Isomorphism problems for hypergraphs , 1974 .
[4] Tom Brylawski,et al. Reconstructing combinatorial geometries , 1974 .
[5] W. Kocay,et al. Some new methods in reconstruction theory , 1982 .