Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article
Data sources: ZENODO
Zenodo
Claim

Computational Evidence for a Conjecture in Graph Theory

descriptionPublicationkeyboard_double_arrow_right Article Under curationPublisher:Zenodo
Authors: SOVEREIGN Research Kernel;

doi: 10.5281/zenodo.20522772

Computational Evidence for a Conjecture in Graph Theory

Abstract

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.

Powered by OpenAIRE graph
Found an issue? Give us feedback