Ramsey Number Counterexample Checking and One Vertex Extension Linearly Bound by $s$ and $t$

TL;DR

This paper introduces algorithms for checking Ramsey number counterexamples and extending graphs by one vertex, with runtime linearly bounded by parameters s and t, verified through specific cases.

Contribution

The paper presents new algorithms for one-vertex extension and counterexample checking with linear runtime bounds based on s and t.

Findings

Verified that certain Ramsey counterexample sets are empty for specific parameters.

Proved that graphs with a certain number of subgraphs belong to extended counterexample sets.

Demonstrated the practical utility of the algorithms in Ramsey number verification.

Abstract

The Ramsey number $R(s,t)$ is the smallest integer $n$ such that all graphs of size $n$ contain a clique of size $s$ or an independent set of size $t$. $\mathcal{R}(s,t,n)$ is the set of all counterexample graphs without this property for a given $n$. We prove that if a graph $G_{n+1}$ of size $n+1$ has $\max\{s,t\}+1$ subgraphs in $\mathcal{R}(s,t,n)$, then $G_{n+1}$ is in $\mathcal{R}(s,t,n+1)$. Based on this, we introduce algorithms for one-vertex extension and counterexample checking with runtime linearly bound by $s$ and $t$. We prove the utility of these algorithms by verifying $\mathcal{R}(4,6,36)$ and $\mathcal{R}(5,5,43)$ are empty given current sets $\mathcal{R}(4,6,35)$ and $\mathcal{R}(5,5,42)$.