Computational Evidence for a Conjecture in Graph Theory

We present computational evidence supporting the following conjecture: ex(n, K_4) = t_3(n) (Turán number). Verify the Turán graph T(n,3) is the unique extremal graph for K_4-free.. An exhaustive search over 3,333 cases found no counterexample. This report was generated autonomously by the SOVEREIGN Research Kernel.