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 program to analyze and check a specific colorize in Ramsey Number R(5, 5).

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 archive repository for a research about colorize the Graphs.

Genetic Algorithm Template

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

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.

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

New lower bounds for some small Ramsey numbers