On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices

DOI10.1109/TIT.2020.2983678zbMath1473.05207arXiv2004.05527OpenAlexW3013486527MaRDI QIDQ5001714

Douglas B. West, Alexandr V. Kostochka

Publication date: 23 July 2021

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.05527

zbMATH Keywords

Kelly conjecturereconstruction conjecture of Ulam

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs ⋮ Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs

This page was built for publication: On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices