Published June 2, 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.1 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:f72c933de0d4ad0e557b13756c3c45c9
|
98.1 kB | Preview Download |