352 Minimum Counterexample: The Power of Exhaustive Search at Small n

The 352 disproof illustrates a key methodological insight: exhaustive enumeration of all trees up to n=18 (205,000+ trees) confirmed ZERO violations at n≤17, yet exactly ONE tree at n=18 breaks the conjecture. This pattern mirrors Conjecture 349 where no counterexample existed below n=28. The implication: many tree conjectures in Graffiti.pc may appear true for all computationally-checkable small cases while failing at moderate scales that are invisible to exhaustive enumeration but reachable through structured construction methods like the caterpillar technique.