Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems

DOI10.1007/BF02349963zbMath0759.05064OpenAlexW2056400482MaRDI QIDQ1199123

William L. Kocay

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1007/bf02349963

zbMATH Keywords

hypergraphstriple systemsPaley graphsreconstructing

Mathematics Subject Classification ID

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

Related Items (9)

The existence of quasi regular and bi-regular self-complementary 3-uniform hypergraphs ⋮ A note on non-reconstructible 3-hypergraphs ⋮ Almost self-complementary 3-uniform hypergraphs ⋮ Vertex-transitive self-complementary uniform hypergraphs of prime order ⋮ Generating self-complementary uniform hypergraphs ⋮ A family of $t$-regular self-complementary $k$-hypergraphs ⋮ Vertex-transitive self-complementary uniform hypergraphs ⋮ Self-complementary hypergraphs and their self-complementing permutations ⋮ Ample simplicial complexes

Cites Work

• A family of non-reconstructible hypergraphs
• Some NP-complete problems for hypergraph degree sequences
• More non-reconstructible hypergraphs
• Graph reconstruction—a survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems