RamseyTh

Building:

mvn package

What it does

---

Ramsey3ColBounder.boundR()

This will obtain an upper bound on R(a, b, c) for 1 <= a, b, c <= 10

R(a, b, c) is least n such that for all 3-colorings of the edges of an n-clique, there exists either

1. RED a-clique or
2. BLUE b-clique or
3. GREEN c-clique

---

Ramsey2ColBounder.boundR()

This will obtain an upper bound on R(a, b) for 1 <= a, b <= 10

R(a, b) is least n such that for all 2-colorings of the edges of an n-clique, there exists either

1. RED a-clique or
2. BLUE b-clique or

---

HomogSetChecker.hasHomogSetSizeK()

Given a coloring of a complete graph (it's edges) and number k, tells you whether or not the graph has a homogenous set size k.

A homogenous set is a subclique such that

---

HomogSetChecker.findMaxHomogSetSize()

Given a coloring of a clique (it's edges) and number k, tells you the size of a maximum homogenous set.