This proof demonstrates reconstructibility from vertex-deleted subgraphs in graphs with three or more vertices, indicating a significant mathematical finding.
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
No takes yet. Share an insight, caveat, or question.
Joseph R. Keen (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: