Pulse Journal Club Trending Explore Questions Researchers

Download the App

Join discussions, follow papers, and never miss your next session.

© Synapse Social LLC, 2026Privacy Policy

Home Explore Journal Club Trending

⌘+K

The Reconstruction Conjecture | Synapse

March 27, 2026Open Access

The Reconstruction Conjecture

Key Points

The research aims to establish that every graph with three or more vertices can be reconstructed using its vertex-deleted subgraphs.
Developed a proof structure for the conjecture.
Analyzed properties of graphs and their vertex-deleted versions.
Confirmed that all graphs on three or more vertices are reconstructible.
Provided a formal mathematical proof supporting this assertion.

Abstract

Preprint v1 — A proof that every graph on three or more vertices is reconstructible from its vertex-deleted subgraphs. Abstract redacted pending IP review. Full abstract and unrestricted access will be available in v2 upon completion of intellectual property proceedings. Author: Joseph Keen Affiliation: Phoenix Quantum Labs LLC

Read Full Paperexternally

Mark Helpful

Bookmark

Relay

View Full Paper

Cite This Study

Joseph R. Keen (Wed,) studied this question.

synapsesocial.com/papers/69c620d515a0a509bde196c9 https://doi.org/https://doi.org/10.5281/zenodo.19216703

Mark Helpful

Bookmark

Relay

View Full Paper