A family of non-reconstructible hypergraphs

DOI10.1016/0095-8956(87)90062-1zbMath0578.05052OpenAlexW2054325002MaRDI QIDQ1066163

William L. Kocay

Publication date: 1987

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(87)90062-1

zbMATH Keywords

hypergraphreconstruction conjecturehypomorphismnon-reconstructability

Mathematics Subject Classification ID

Hypergraphs (05C65) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (13)

Hypomorphisms, orbits, and reconstruction ⋮ Generalisations of hypomorphisms and reconstruction of hypergraphs ⋮ Reconstructing under group actions. ⋮ Note on Kocay's 3-hypergraphs and Stockmeyer's tournaments ⋮ A note on non-reconstructible 3-hypergraphs ⋮ Totally symmetric functions are reconstructible from identification minors ⋮ Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs ⋮ The double reconstruction conjecture about finite colored hypergraphs ⋮ Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems ⋮ More non-reconstructible hypergraphs ⋮ Reconstructing subsets of \(\mathbb{Z}_n\) ⋮ Set-reconstructibility of Post classes ⋮ Hypomorphic Sperner systems and non-reconstructible functions

Cites Work

• On the nonreconstructibility of combinatorial geometries
• A combinatorial perspective on the Radon convexity theorem
• On Stockmeyer's non-reconstructible tournaments
• Graph reconstruction—a survey
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A family of non-reconstructible hypergraphs