Graph Reconstruction Checker

vertex-deleted deck

All Tools

Loading tool...

About Graph Reconstruction Checker

A graph reconstruction checker exploring Kelly-Ulam Reconstruction Conjecture: every graph with n≥3 is determined by its deck (multiset of vertex-deleted subgraphs). Verified for n≤13. Kelly's lemma: subgraph counts reconstructible. Client-side.

Graph Reconstruction Checker Features

  • Deck display
  • Reconstruction
  • Kelly lemma
  • Edge count
  • Common graphs

More Checkers Tools

Explore all 223 other checkers tools available on Generatr

Academic Readability Graderads.txt ValidatorAI Content DetectorAlexander McQueen Serial Number CheckerAnagram CheckerAnalog Gem Tester SimulatorAnsible LinterArc-Transitive Graph CheckerAudemars Piguet Serial Number CheckerAuto Parts Compatibility CheckerBike Serial Number CheckerBlocked Checker TwitterBluesky Block CheckerBottega Veneta Serial Number CheckerBrawl Stars Mastery CheckerBulk SERP CheckerBulova Serial Number CheckerCanned Phrase & Cliche CheckerCar Stereo Compatibility CheckerCartier Love Bracelet Serial Number CheckerCartier Serial Number CheckerCeline Serial Number CheckerCetaphil Lot Number CheckerCGC Certification LookupCharacter Frequency CounterChordal Graph CheckerCircleboom Shadowban CheckerClash Royale Deck CheckerClash Royale Synergy CheckerCograph Recognition Checker
View all 223 checkers tools
Advertisement
Advertisement