example B n = 6 edges = [(0, 1), (0, 2), (0, 3), (2, 4), (2, 5), (3, 4), (3, 5), (4, 5)]
degrees [3, 1, 3, 3, 3, 3] all odd: True | vertex x = 0 | p = 61/100
check (1): every flip lowers the number of disagreeing edges: OK
(2) f(inf) = 41541389119/62500000000 = 0.664662225904
(3) closed form has 6 nonzero terms; self-checks: f(0) == p: True ; constant term == f(inf): True
    e^-1t: c[1]=-1109016051/20000000000 (-5.545080e-02), c[2]=560304459/80000000000 (7.003806e-03)
    e^-3t: c[1]=-145264119/40000000000 (-3.631603e-03)
    e^-5t: c[1]=4420179621/1000000000000 (4.420180e-03), c[2]=435792357/400000000000 (1.089481e-03)
(4) leading term of f(t)-f(inf): c[1,2] t^1/1! e^(-1 t), c = 560304459/80000000000, sign +
(5) t0 = 223/25 = 8.92 ; uniformization: K = 220 , J = 220
    lower bound L <= f(t0): 0.6646631648158696 ; L - f(inf) = 9.389118696231476e-07 ; L > f(inf): True
(6) closed form: 0.664663164816 <= f(t0) <= 0.664663164816 ; consistent with (5): True ; f(t0) - f(inf) in [9.389119e-07, 9.389119e-07]
CERTIFIED: f(t0) > f(inf), so t -> f(t) is not non-decreasing.
