A note on non-reconstructible 3-hypergraphs
type: Item
instance of: scholarly article
title: A note on non-reconstructible 3-hypergraphs
zbMATH Open document ID: 1349.05239
author: William Kocay
published in: Graphs and Combinatorics
publication date: 2016-11-29T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 6657156
zbMATH Keywords: hypergraph
zbMATH Keywords: Ulam's problem
zbMATH Keywords: graph reconstruction
zbMATH Keywords: subgraph counting
zbMATH Keywords: pseudo-similarity
describes a project that uses: Groups & Graphs
MaRDI profile type: Publication
full work available at URL: s00373-015-1671-x
OpenAlex ID: W2232284992
cites work: Q3975132
cites work: Graph reconstruction—a survey
cites work: Constructing graphs with pairs of pseudo-similar vertices
cites work: Self-complementary non-uniform hypergraphs
cites work: Q5454407
cites work: Q3967564
cites work: Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems
cites work: A family of non-reconstructible hypergraphs
cites work: More non-reconstructible hypergraphs
cites work: Q4414312
cites work: Isomorph-Free Exhaustive Generation
cites work: Q3870936
cites work: Self-complementary hypergraphs
DOI: 10.1007/S00373-015-1671-X
description: scientific article; zbMATH DE number 6657156