FPRD LabShare an approach

← Claims

Computational finding

QA-GR-C03

Marked-extension orbit census

Exact statement

For all 52 unlabeled graphs of orders one through five, deletion-type classes equal marked-vertex automorphism orbits.

StatusReproduced
External reviewNo documented external or specialist review of this Quotient Arsenal result is recorded.

Context

Anonymous overlap types can all agree while the cards still fail to share one coherent naming. The smallest computed witness converts that mismatch into an equivariant matching defect.

Proof or evidence

The exact census compares every vertex pair in all 52 graphs.

Graph-deck synchronization proof and independent audit →

Verification notes

An independent implementation reconstructed all 18 type-slot synchronizations, all 73,728 candidate row namings, the two symmetry orbits, all 864 S2 x S4 equivariance actions, and the 52-graph marked-orbit control through order five.

Limitations

  • The equality is a bounded observation, not a general theorem.

Open work

Seek the first graph where marked orbits strictly refine deletion types.