# Difference between revisions of "Ramsey Number"

This is a Helper Page for:
Pigeonhole Principle

Work In Progress

## Definition

Ramsey number $R(m, n)$ is the solution to the party problems, which ask the minimum number of guests that must be invited so that at least $m$ will know each other or at least $n$ will not know each other.

## A Summary of Known Ramsey Numbers

 m, n 1 2 3 4 5 6 7 8 9 10 1 1 1 1 1 1 1 1 1 1 1 $i=3$ $i=4$ $i=5$ $i=...$ $...$ Image X