example C10 n = 10 edges = [(0, 1), (0, 2), (0, 3), (1, 6), (1, 7), (2, 4), (2, 5), (3, 4), (3, 5), (4, 5), (6, 8), (6, 9), (7, 8), (7, 9), (8, 9)]
degrees [3, 3, 3, 3, 3, 3, 3, 3, 3, 3] all odd: True | vertex x = 0 | p = 7/10
check (1): every flip lowers the number of disagreeing edges: OK
(2) f(inf) = 90794489017687/115200000000000 = 0.7881466060563108
(3) closed form has 19 nonzero terms; self-checks: f(0) == p: True ; constant term == f(inf): True
    e^-1t: c[1]=-14057525153/90000000000 (-1.561947e-01), c[2]=1485516389/20000000000 (7.427582e-02)
    e^-2t: c[1]=43196257083/800000000000 (5.399532e-02), c[2]=55093689/20000000000 (2.754684e-03)
    e^-3t: c[1]=1046101/50000000 (2.092202e-02)
    e^-4t: c[1]=617395803101/120000000000000 (5.144965e-03), c[2]=-52568842529/4000000000000 (-1.314221e-02), c[3]=-362149347/200000000000 (-1.810747e-03)
    e^-5t: c[1]=-1125821697/100000000000 (-1.125822e-02), c[2]=-64827/12500000 (-5.186160e-03)
    e^-6t: c[1]=-3413879/5000000000 (-6.827758e-04), c[2]=-4911417/10000000000 (-4.911417e-04)
    e^-7t: c[1]=-1039633/18750000000 (-5.544709e-05)
    e^-8t: c[1]=-9275427/102400000000 (-9.058034e-05), c[2]=735147/12800000000 (5.743336e-05)
    e^-9t: c[1]=1551099067/22500000000000 (6.893774e-05), c[2]=16140551/500000000000 (3.228110e-05)
    e^-10t: c[1]=28036477/7200000000000 (3.893955e-06)
(4) leading term of f(t)-f(inf): c[1,2] t^1/1! e^(-1 t), c = 1485516389/20000000000, sign +
(5) t0 = 3 = 3.0 ; uniformization: K = 150 , J = 150
    lower bound L <= f(t0): 0.7916206931684938 ; L - f(inf) = 0.003474087112183083 ; L > f(inf): True
(6) closed form: 0.791620693168 <= f(t0) <= 0.791620693168 ; consistent with (5): True ; f(t0) - f(inf) in [3.474087e-03, 3.474087e-03]
CERTIFIED: f(t0) > f(inf), so t -> f(t) is not non-decreasing.
