Chapter 11

:
Ramsey
 Ramsey
numbers of
o The William Lowell Putnam Mathematical competition for
undergraduates had taken place since 1938.
graph
o The exam was administered by the Mathematical Association of
America, consists of twelve 12challenging mathematical
problem.
o This competition was designed to stimulate a healthy rivalry in
colleges and universities throughout the United States and
Canada.
o The 1953 exam contained the following problem:
Problem A2. The complete graph with 6 points vertices and 15
edges has each edge colored red or blue. Show that the edges
joining them are the same color.
 FRANK
o
PLUMPTON
Born on February 22, 1903 in Cambridge, Cambridgeshire,
England.
o
o RAMSEY
He entered Winchester College in 1915.
After completing his education in 1920, he went to Trinity
College, Cambridge on a scholarship to study Mathematics.
o In 1924, he was elected as a Fellow of King’s College,
Cambridge, an especially notable honor since he never attended
King’s College.
o In 1925, he published his first major work “The Foundation of
Mathematics”. It was Ramsey’s intent to improve on Principia
Mathematica by the Bertrand Russell and Alfred North
Whitehead.
 FRANK
o
to the PLUMPTON
His second paper “On a problem of formal logic” was presented
London Mathematical Society. It was this paper that lead

o RAMSEY
to concepts and a theory that bear his name.
Ramsey was deeply interested in economics and philosophy. His
work on economics included probability, the theory of taxation
and optimal saving.
o Philosophy was his main interest, however. He worked so
intensely that he only studied four hours per day, which left him
time to do other things he enjoyed: tennis, walking, listening to
music.
o His promising future ended abruptly at age 26 when he died on
January 19, 1930.
Ramsey numbers
-  is the smallest party size that guarantees a
group of m mutual friends or a group of n
n mutual non-friends. Alternatively, it is the
minimum number of vertices a complete graph
must have so that if every edge is colored blue
or red, there is a red clique of mm vertices or a
blue clique of n n vertices.
Properties of Ramsey
numbers
 is trivial since has no edges and so no edge
to color

e.g.
The Ramsey numbers
R(r, b) for r, b ≤ 10
Ramsey
numbers
 Show that any party with at least 6 people will contain a group of
three mutual friends or a group of three mutual non-friends.

Solution:
Call the people A, B, C, D, E, F.
Either A has three friends or three
non-friends. Without loss of
generality, suppose that B,C,D are
all friends with A. Then if any pair
of them are friends with each other,
that pair plus A forms a group of
three mutual friends. If no two of
them are friends, then they are a
group of three mutual non-friends.
Definitions
in
 DEFINITION 1.1: GRAPH
A graph G=(V,E) is a set of vertices and edges, where V(G) and
E(G) are the set of vertices and edges in G, respectively.
 DEFINITION 1.2: COMPLETE
GRAPH
A complete graph on n vertices, denoted Kn, is a graph in which
every vertex is adjacent, or connected by an edge, to every
vertex in G.
 DEFINITION 1.3: CLIQUE
A clique is a subset of vertices such that there exists an edge
between any pair of vertices in that subset of vertices. This is
equivalent to having a complete subset.
 DEFINITION 1.4:
INDEPENDENT
An independent SET
set of a graph is a subset of vertices such that
there exists no edges between any pair of vertices in that subset.
 DEFINITION 1.5: EDGE
Let C be a set of colorsCOLORING
{c ,c ,…,c } and E(G) be the edges of a
1 2 m
graph G. An edge coloring f: EC assigns each edge in E(G) to a
color in C. If an edge coloring uses k colors on a graph, then it is
known as a k-colored graph
Text text text text text text text text
text text
MODIFIED
RAMSEY
NUMBERS
Modified Ramsey
Numbers Monochromatic Graph
- r(F,G) - is a colored graph (either vertex colored or
- is the smallest value of n such that edge-colored depending on the context on the
any 2-coloring of the edges of kn context) in which each of the vertices or edges
contains either a red copy of g or a is assigned the same color.
blue copy off

Monochromatic
Ramsey Number
- 𝑚𝑟(𝐹,𝐻)
- smallest positive integer n such that if each edge of
kn is colored with one of two colors, then a
monochromatic f or a monochromatic h result.
certainly, and for every two graphs f and h. we also
have .
Paul Erdos And Richard
Rado
- sufficiently large integer n and a complete
graph of order n whose vertices are 1, 2, …,
n and whose edges are colored from the set
of positive integers that there must be a
complete subgraph of prescribed order that
is monochromatic or rainbow or has a
minimum or maximum coloring.
Arie Bialostocki And
William Voxman
- rainbow ramsey numbers, denoted as as the
smallest positive integer n such that if each edge of
the complete graph kn is colored from any number
of colors, then it’s either the edges has the same
color or what we call monochromatic f or a rainbow
f is produced.
Theorem 11.20
FOR EVERY POSITIVE INTEGER K, THERE
EXISTS A POSITIVE INTEGER N SUCH THAT IF
EACH EDGE OF Kn WITH VERTEX SET {1, 2, …,
n} IS COLORED FROM THE SET OF POSITIVE
INTEGERS, THEN THERE IS A COMPLETE
SUBGRAPH OF ORDER K THAT IS EITHER
MONOCHROMATIC OR RAINBOW OR HAS A
MINIMUM OR MAXIMUM COLORING.
 Theorem 11.21
LET F BE A GRAPH WITHOUT ISOLATED VERTICES.
THE RAINBOW RAMSEY NUMBER RR(F) IS
DEFINED IF AND ONLY IF F IS A FOREST. PROOF.
FIRST, ASSUME THAT F IS NOT A FOREST. THEN F
CONTAINS A CYCLE C, OF LENGTH K ≥ 3 SAY. LET n
BE AN INTEGER WITH N ≥ K. LET THE VERTEX SET
OF A COMPLETE GRAPH Kn BE {1, 2, …, n} AND FOR
1 ≤ I ≤ J ≤ n, ASSIGN THE COLOR I TO THE EDGE IJ.
THIS IS THEN A MINIMUM COLORING OF Kn. WE
MAY ASSUME THAT 𝐶 = (𝑣1, 𝑣2, …, 𝑣𝑘, 𝑣1), 𝑤ℎ𝑒𝑟𝑒
 Theorem 11.23
LET F1 AND F2 BE TWO GRAPHS WITHOUT
ISOLATED VERTICES. THE RAINBOW RAMSEY
NUMBER RR(F1, F2) EXISTS IF AND ONLY IF F1
IS A STAR OR F2 IS A FOREST. IF F1 AND F2 ARE
NONEMPTY GRAPHS OF ORDERS N1 AND N2,
RESPECTIVELY, FOR WHICH RR(F1, F2) IS
DEFINED, THEN �
THANK
YOU 