ramsey-numbers

The research about Ramsey Number based on Python.

Ramsey number R(r, s) is the smallest number of nodes n such that for each undirected graph of size n, there is either a complete subgraph of size r, or an empty subgraph of size s

The research about Ramsey Number based on C.

A research repository about the Ramsey numbers and explore the new data in the mathematics field to write an article using One Programming Language.

A program to analyze and check a specific colorize in Ramsey Number R(5, 5).

A archive repository for a research about colorize the Graphs.

A constructive proof of R(k+1,s+1) >= R(k,s)+2k+2s for 5<=k<=s

Genetic Algorithm Template

Code accompanying the paper "Small Ramsey numbers for books, wheels, and generalizations"

New lower bounds for some small Ramsey numbers

Ramsey Graph Database 拉姆齐图数据库

Small browser game prototype

Visualize Ramsey numbers and reinforce your understanding of graph theory!

Python module to explore Ramsey numbers for Tadpole graphs (my discovery, paper pending).

Solving the simplest case aka "the Party Problem", i.e. R(3,3) Ramsey number related to a complete graph of 2-colored edges, using MatLab and Monte Carlo simulations with acceptance rule.

Heuristic search for K₅-free graphs on 43 vertices — an experimental attack on R(5,5) ≥ 44

Autonomous LLM-agent investigation of Ramsey number R(5,5). 24-generation evolutionary trace + reproducible PySAT pipeline showing 2-block circulant Z_21 x Z_22 on N=43 is UNSAT in ~5 seconds. Methodology demo, not a new math result.