example A n = 6 edges = [(0, 1), (0, 2), (1, 3), (1, 4), (1, 5), (2, 3), (2, 4), (2, 5), (3, 5), (4, 5)]
degrees [2, 4, 4, 3, 3, 4] all odd: False | vertex x = 0 | p = 7/10
check (1): every flip lowers the number of disagreeing edges: OK
(2) f(inf) = 1016603/1250000 = 0.8132824
(3) closed form has 7 nonzero terms; self-checks: f(0) == p: True ; constant term == f(inf): True
    e^-1t: c[1]=-13853/120000 (-1.154417e-01), c[2]=-1127/50000 (-2.254000e-02), c[3]=147/6250 (2.352000e-02)
    e^-4t: c[1]=-49/30000 (-1.633333e-03)
    e^-5t: c[1]=18963/5000000 (3.792600e-03), c[2]=441/125000 (3.528000e-03)
(4) leading term of f(t)-f(inf): c[1,3] t^2/2! e^(-1 t), c = 147/6250, sign +
(5) t0 = 27/5 = 5.4 ; uniformization: K = 157 , J = 157
    lower bound L <= f(t0): 0.8137600913650723 ; L - f(inf) = 0.00047769136507233074 ; L > f(inf): True
(6) closed form: 0.813760091365 <= f(t0) <= 0.813760091365 ; consistent with (5): True ; f(t0) - f(inf) in [4.776914e-04, 4.776914e-04]
CERTIFIED: f(t0) > f(inf), so t -> f(t) is not non-decreasing.
