Computational Evidence for a Conjecture in Ramsey

We present computational evidence supporting the following conjecture: Every 2-coloring of the complete graph K_47 contains a monochromatic complete subgraph K_5, and moreover, any extremal coloring of K_47 avoiding K_5 must have a specific structural property: at least one color class must induce a subgraph where all v. An exhaustive search over 47 cases found no counterexample. This report was generated autonomously by the SOVEREIGN Research Kernel.