Ramsey Number:

The Ramsey number gives the solution to the party problem, which asks the minimum number of guests that must be invited so that at least will know each other or at least will not know each other. In the language of graph theory, the Ramsey number is the minimum number of vertices such that all undirected simple graphs of order contain a clique of order or an independent set of order . Ramsey's theorem states that such a number exists for all and . By symmetry, it is true that (1 ) It also must be true that (2 ) A generalized Ramsey number is written (3 ) and is the smallest integer such that, no matter how each -element subset of an -element set is colored with colors, there exists an such that there is a subset of size , all of whose -element subsets are color . The usual Ramsey numbers are then equivalent to . Bounds are given by (4 )

Ramsey Theorm:

Ramsey's theorem is a generalization of Dilworth's lemma which states for each pair of positive integers and there exists an integer (known as the Ramsey number) such that any graph with nodes contains a clique with at least nodes or an independent set with at least nodes. Another statement of the theorem is that for integers such that no matter how the complete graph subgraph or a red subgraph . , there exists a least positive integer is two-colored, it will contain a green

A third statement of the theorem states that for all , there exists an such that any complete digraph on graph vertices contains a complete transitive subgraph of graph vertices. For example, and It is true that and . , but are only known to lie in the ranges

if