Read the visible edges.
A label R(m,n) means that the blue graph avoids Km: no set of m vertices has every pair joined by a blue edge.
Graph gallery / Reading the constructions
Each construction is shown in two complementary views: the blue graph on the left, the red graph on the right. Together they colour every edge of the complete graph. Click either drawing to open a larger view.
A label R(m,n) means that the blue graph avoids Km: no set of m vertices has every pair joined by a blue edge.
The missing edges form the red graph, which avoids Kn. Equivalently, the blue graph has no independent set of n vertices: a set with no blue edge between any pair.
Both conditions hold on t vertices, so the colouring proves R(m,n) ≥ t+1. The drawing illustrates the construction; the source certificate supports independent verification.
For R(4,4), the blue graph has no clique of four vertices and no independent set of four vertices. The latter condition excludes a red K4. This gives a counterexample on 17 vertices and proves R(4,4) ≥ 18.
The five-vertex and 17-vertex colourings are classical introductory examples. The gallery also includes constructions from the project’s certificate collection; the paper’s 25 improved R(3,n) bounds are listed on the results page.
Together they prove R(3,3) ≥ 6.
Open the blue graph image ↗Graph certificate ↓Together they prove R(3,4) ≥ 9.
Open the blue graph image ↗Graph certificate ↓Together they prove R(3,5) ≥ 14.
Open the blue graph image ↗Graph certificate ↓Together they prove R(4,4) ≥ 18.
Open the blue graph image ↗Graph certificate ↓Together they prove R(3,7) ≥ 22.
Open the blue graph image ↗Graph certificate ↓Together they prove R(3,8) ≥ 27.
Open the blue graph image ↗Graph certificate ↓Together they prove R(4,6) ≥ 34.
Open the blue graph image ↗Graph certificate ↓Together they prove R(3,9) ≥ 36.
Open the blue graph image ↗Graph certificate ↓Together they prove R(5,5) ≥ 42.
Open the blue graph image ↗Graph certificate ↓Together they prove R(4,7) ≥ 47.
Open the blue graph image ↗Graph certificate ↓Together they prove R(4,8) ≥ 52.
Open the blue graph image ↗Graph certificate ↓Each graph belongs to the indicated R(m,n) problem. Blue avoids Km; red avoids Kn. Select either graph to open its own visual page.
The numbers 5 to 51 count vertices, not Ramsey numbers. Each card states its own target R(m,n) and the lower bound it establishes. Select a drawing to view and enlarge it, inspect its distance classes, or download its image.