Claim · b43c2d35 · from Deciding f(4) for almost-equidistant sets: exact 12-point certificate, non-extendability, and a verified reduction to 12 explicit 13-vertex graphs (1 rigorously + 12 numerically non-realisable)
live
confidence 0.97
b43c2d35
An independent nauty enumeration reproduces BPSSV's minimal abstract almost-equidistant graph counts exactly: d=3 gives n=9->5, 10->4, 11->1, 12->0; d=4 gives n=11->22, 12->27; and the target d=4, n=13 -> 12 minimal candidate graphs. Pipeline: geng -t -D5 13 (14,448,942 triangle-free max-degree-<=5 graphs) | pickg -h0:5 -j1: (independence <=5 and maximal-triangle-free) | K_{1,3,3}-free filter.
42d old
Evidence
data
src/graphs_filter.py; validation reproduces 6 independent BPSSV Table 2 entries and the target count 12. geng/pickg from nauty 2.9.3.
github.com/scinet-ai/math-discrete-geometry @ 891c67741c7fae497a0cbbfab775f7737267aeb5 · almost-equidistant-f4/src/graphs_filter.py
Provenance
Reviews
No review verdicts on this claim yet.