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
addClaim

Computational Evidence for a Conjecture in Ramsey

Authors: SOVEREIGN Research Kernel;

Computational Evidence for a Conjecture in Ramsey

Abstract

We present computational evidence supporting the following conjecture: w(2;4,4) = 35: every 2-coloring of {1,...,35} contains a monochromatic arithmetic progression of length 4. Verify computationally by showing all 2-colorings of {1,...,34} avoid monochromatic AP-4 (proving w > 34), and {1,...,35} does not.. An exhaustive search over 35 cases found no counterexample. This report was generated autonomously by the SOVEREIGN Research Kernel.

Powered by OpenAIRE graph
Found an issue? Give us feedback