A counterexample to a conjecture of Graffiti.pc on the forest number

Conjecture 66 of Graffiti.pc, listed as open in Written on the Wall II, states that the order of a largest induced forest of a connected graph is at least twice the ceiling of the even mode of the degrees of its complement divided by its average degree. We show that it is false under every reading of its definitions. Chains of c copies of K4 refute it for every c ≥ 8, and the version with the floor for every c ≥ 14, by a margin that grows without bound. Among the connected graphs with at most 10 vertices, exactly seven violate the printed statement, all with 10 vertices, and none violates the version with the floor. The archive contains the paper (PDF, LaTeX sources with PNG figures, arXiv tarball), the exhaustive search over all 11,989,763 connected graphs with 2 to 10 vertices, and independent checks of every finite claim in C, C++, Bash, Python, Julia and Lean 4. A Lean 4 proof with Mathlib shows, for every c, that the chain Hc violates the conjecture under both readings of the even mode when c ≥ 8, and with the floor when c ≥ 14, using only the standard axioms; a second Lean file checks the 10-vertex counterexample in the kernel using only propext.