Computational Certificates and Coloring for Multicolor Ramsey Numbers Involving C4

This dataset provides computational certificates and verification materials supporting the results of the manuscript "Multicolor Ramsey Numbers Involving C4: Improved Bounds and an Equality" by Luis Boza. The archive contains: DIMACS CNF instances and DRAT unsatisfiability certificates for two finite graph-coloring obstructions involving K12 minus a matching of five edges and K13 minus a vertex-disjoint union of four edges and a five-vertex graph H, where H is the complement of K2,3 minus one edge. Python code for generating and checking the computational instances. An explicit four-coloring of the edges of K87 avoiding C4 in two colors and K4 in the other two, establishing R(C4,C4,K4,K4) ≥ 88. Verification scripts, instructions, and SHA-256 checksums for reproducibility. The unsatisfiability certificates were generated using CaDiCaL and independently verified using drat-trim. The explicit coloring was checked computationally. The dataset is intended to provide reproducible computational evidence for the corresponding mathematical results.