Published May 30, 2026
| Version v1
Journal article
Open
Computational Evidence for a Conjecture in Graph Theory
Authors/Creators
Description
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.
Files
paper.pdf
Files
(98.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:4c651decdba630a29f1f7c15b393dd49
|
98.8 kB | Preview Download |