Reconstruction of p-disconnected graphs
Pavel Skums
TL;DR
This paper proves the Kelly-Ulam conjecture specifically for p-disconnected graphs, advancing understanding of graph reconstruction in this class.
Contribution
It establishes the validity of the Kelly-Ulam conjecture for p-disconnected graphs, a previously unresolved case.
Findings
Kelly-Ulam conjecture holds for p-disconnected graphs
Provides a proof confirming the conjecture in this graph class
Enhances knowledge of graph reconstruction theory
Abstract
We prove that Kelly-Ulam conjecture is true for p-disconnected graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Finite Group Theory Research · Complexity and Algorithms in Graphs