The double reconstruction conjecture about finite colored hypergraphs
From MaRDI portal
Publication:912131
DOI10.1016/0095-8956(92)90066-7zbMath0698.05056OpenAlexW1981867266MaRDI QIDQ912131
Publication date: 1992
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(92)90066-7
Hypergraphs (05C65) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A congruence theorem for trees
- A family of non-reconstructible hypergraphs
- Reconstructing colored graphs
- On Ulam's conjecture for separable graphs
- On incidence matrices of finite projective and affine spaces
- The falsity of the reconstruction conjecture for tournaments
- Graph reconstruction—a survey
- On dichromatic polynomials
- A counterexample to the countable version of a conjecture of Ulam
- On nonreconstructable tournaments
This page was built for publication: The double reconstruction conjecture about finite colored hypergraphs
