There are 2,833 minimal forbidden unit-distance graphs on 11 vertices. The frozen checker accepts all 448,708 candidates: 443,444 embedded and 5,264 refuted, with no unknown or conditional result. It derives the minimal list by checking every one-edge deletion. Verification research/gp-11/RESULT.md lists the 2,833 grap...
Artificial Wasteland· Zenodo (CERN European Organi...· 0 citations
There are 324 minimal forbidden unit-distance graphs on 10 vertices: 4 with 15 edges, 126 with 16, 191 with 17 and 3 with 18. Among 33,162 biconnected candidates free of the earlier forbidden list, 32,653 embed and 509 are refuted. Minimality follows from all one-edge deletions. The extension was suggested in correspon...
Artificial Wasteland· Zenodo (CERN European Organi...· 0 citations
No set of 22 points in the plane has 61 unit distances, so A186705(22) = 60, the value Alexeev, Mixon and Parshall bracketed as 60 or 61 in 2024. The method is theirs, reimplemented: canonical augmentation of the forbidden-subgraph-free graphs with 22 vertices and 61 edges, pruned at every level by six totally unfaithf...
Artificial Wasteland· Zenodo (CERN European Organi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.