A note on non-reconstructible 3-hypergraphs

DOI10.1007/S00373-015-1671-XMaRDI QIDQ343751zbMATH OpenOpenAlexFDO

Authors William 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

graph reconstructionhypergraphpseudo-similaritysubgraph countingUlam's problem

Mathematics Subject Classification ID

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

Recommendations

• A family of non-reconstructible hypergraphs
• More non-reconstructible hypergraphs
• Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems
• Reconstruction of hypertrees
• Note on Kocay's 3-hypergraphs and Stockmeyer's tournaments

Cites work

• A family of non-reconstructible hypergraphs
• Constructing graphs with pairs of pseudo-similar vertices
• Graph reconstruction—a survey
• scientific article; zbMATH DE number 3674136 (Why is no real title available?)
• scientific article; zbMATH DE number 3790470 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 1952951 (Why is no real title available?)
• scientific article; zbMATH DE number 5255704 (Why is no real title available?)
• Isomorph-Free Exhaustive Generation
• More non-reconstructible hypergraphs
• Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems
• Self-complementary hypergraphs
• Self-complementary non-uniform hypergraphs

Cited in

(6)

• A family of non-reconstructible hypergraphs
• On null 3-hypergraphs
• Critical 3-hypergraphs
• A study on the existence of null labelling for 3-hypergraphs
• More non-reconstructible hypergraphs
• Deciding nonconstructibility of 3-balls with spanning edges and interior vertices

Describes a project that uses

Uses Software

• Groups & Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343751)