A note on non-reconstructible 3-hypergraphs

DOI10.1007/S00373-015-1671-XzbMath1349.05239OpenAlexW2232284992MaRDI QIDQ343751

William L. Kocay

Publication date: 29 November 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1671-x

zbMATH Keywords

hypergraphgraph reconstructionpseudo-similaritysubgraph countingUlam's problem

Mathematics Subject Classification ID

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

Related Items (2)

On null 3-hypergraphs ⋮ A study on the existence of null labelling for 3-hypergraphs

Uses Software

• Groups & Graphs

Cites Work

• A family of non-reconstructible hypergraphs
• Constructing graphs with pairs of pseudo-similar vertices
• Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems
• Self-complementary non-uniform hypergraphs
• More non-reconstructible hypergraphs
• Self-complementary hypergraphs
• Graph reconstruction—a survey
• Isomorph-Free Exhaustive Generation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on non-reconstructible 3-hypergraphs