RAMSEY THEORY

EDY TRI BASKORO

Combinatorial Mathematics Research Group
Faculty of Mathematics and Natural Science
INSTITUT TEKNOLOGI BANDUNG
CIMPA-UNESCO-INDONESIA School
Extremal Problems and Hamiltonicity in Graphs
2-13 February 2009
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Outline
1 Introduction
2 The Four Problems
3 Classical Ramsey Number
4 Graph Ramsey Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Outline
1 Introduction
2 The Four Problems
3 Classical Ramsey Number
4 Graph Ramsey Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Theme of Ramsey Theory
Ramsey theory was initially studied in the context of the
problem of nding a regular procedure to determine the
consistency of any given logical formula (1928).
The objective was to give a decision procedure for the
sentences of propositional logic.
Complete disorder is impossible is the theme of Ramsey
Theory, as stated by Theodore S. Motzkin.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Interpretation of Ramsey Theory
A non-technical interpretation of Ramsey Theory:
Every suciently large structure, regardless of how
disorderly it may appear to be, contains an orderly
substructure of any prescribed size.
The Ramsey theory becames famous after Paul Erdos and
George Szekeres (1935) applied it in graph theory.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Four problems of similar type
Problems of nding Schur Number and van der Waerden
number. These problems are concerned about sequence of
numbers.
The third problem appears in Discrete Geometry, namely
Erdos Szekeres problem, and the fourth problem is about
Ramsey numbers.
These problems have the same property, namely they are
the problem of nding a regular substructure in a
suciently large combinatorial structure.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Outline
1 Introduction
2 The Four Problems
3 Classical Ramsey Number
4 Graph Ramsey Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Schur Numbers (1916)
Problem 2.1
For integer k, nd the smallest integer S(k) so that, if [S(k)] is
k-colored there exist x, y, and z in the same class such that
x +y =z.
There are four values of S(k) known so far, namely:
S(1) =2
S(2) =5 (1, 2, 3, 4)
S(3) =14 and
S(4) =45.
S(5) appears to be a dicult computational problem.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
van der Waerden Numbers (1927)
Problem 2.2
For integers k and r , nd the smallest integer W(k, r ) so that,
if [W(k, r )] is r -colored there exists a monochromatic arithmetic
progression of k-terms.
Clearly, W(2, r ) =r +1 and W(k, 1) =k.
There are ve values of W(k, r ) known so far, namely:
W(3, 2) =9, (1, 2, 3, 4, 5, 6, 7, 8)
W(4, 2) =35
W(3, 3) =27
W(3, 4) =76 and
W(5, 2) =178.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Erdos-Szekeres Numbers (1935)
Problem 2.3
For any integer k 3, determine the smallest positive integer
N(k) such that any set of at least N(k) points in general
position in the plane (i.e., no three of the points are co-linear)
contains k points forming a convex k-gon.
Clearly, N(3) =3.
Erdos and Szekeres conjectured:
N(k) =2
k2
+1, for all k 3.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Erdos-Szekeres Numbers (1935)
N(4) =5. (Klein)
N(5) =9. (E. Makai), (Kalbeisch et al. 1970)
N(6) =17 ?
Toth and Valtr (1998):
N(k)

2k 5
k 3

+2.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Ramsey Numbers (1928)
Problem 2.4
For integers n and m, nd the smallest integer r :=R(n, m)
such that in any 2-coloring (red or blue) on the edges of the
complete graph K
r
on r vertices, there exists either a
monochromatic complete graph on n or m vertices. (F.P.
Ramsey, 1928)
R(3, 3) =6.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Outline
1 Introduction
2 The Four Problems
3 Classical Ramsey Number
4 Graph Ramsey Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Basic property
Ramsey Number R(s, t ) has the following properties.
Trivially, we have:
Symmetry: R(s, t ) =R(t , s), for all s, t 2.
R(s, 2) =R(2, s) =s.
Theorem 3.1
The function R(s, t ) is nite for all s, t 2. If s >2, t >2, then:
R(s, t ) R(s 1, t ) +R(s, t 1), and
R(s, t )

s +t 2
s 1

.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
The Proof of Theorem 3.1
R(s, t ) R(s 1, t ) +R(s, t 1).
Let n =R(s 1, t ) +R(s, t 1).
Consider any red-blue coloring on the edges of K
n
. Since
the degree of vertex x: d(x) =R(s 1, t ) +R(s, t 1) 1,
then there are at least n
1
=R(s 1, t ) red edges or
n
2
=R(s, t 1) blue edges incident to x.
In any case, we will have a red K
s
or a blue K
t
.
By induction on s +t .
If s =2 or t =2, it holds. Assume it holds for
2 s

+t

<s +t . Then,
R(s, t ) R(s 1, t ) +R(s, t 1)
R(s, t )

s +t 3
s 2

s +t 3
s 1

s +t 2
s 1

.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
R(3, 4) =9.
Theorem 3.2
R(3, 4) =9.
Proof.
Consider any 2-coloring on K
9
. Consider the induced subgraph
by red edges. Then, this subgraph cannot be 3-regular.
Therefore, there are two possibilities:
Case 1. v V (K
9
) incident with 4 red edges.
Case 2. v V (K
9
) incident with 6 blue edges.
In any case, there will be a red K
3
or a blue K
4
.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Nine Ramsey Numbers
Finding the exact value of R(n, m) has received a lot of
attention. However, the results are still far from satisfactory.
Greenwood & Gleason (1955):
R(3, 3) =6, R(3, 4) =9, R(3, 5) =14, R(4, 4) =18.
Kry (1964): R(3, 6) =18.
Kalbeisch (1965): R(3, 7) =23
Grienstead & Roberts (1982): R(3, 8) =28; R(3, 9) =36.
McKay & Radziszowski (1995): R(4, 5) =25.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Nine Ramsey Numbers
For any other values of m, n 3 determining the exact
value of Ramsey numbers is a dicult problem. However,
some non-trivial lower and upper bounds for these
numbers have been obtained, see [S. P. Radziszowski,
(2006)].
Ramseys theorem has inspired many striking and dicult
problems. In this lecture, we present a survey on some
various types of Ramsey Numbers. The rst type concerns
the development of graph Ramsey numbers (presented in
Section 4). In the second type we consider the study of
Size Ramsey numbers (Section 5). In Section 6, we will
Ramsey-minimal graphs.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Diagonal Ramsey Numbers
R(s, s) is greatest interest since it is the hardest to estimate.
R(s, s)

2s 2
s 1

2
2s2

s
.
It is hardly to improve this bound. The best improvement
was due to Thomason (1988):
R(s, s)
2
2s
s
, if s is big.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Diagonal Ramsey Numbers
R(s, s) grows exponentially: R(s, s) 2
s/2
.
It is widely believed that there is a constant c, perhaps
even c =1, such that:
R(s, s) =2
(c+o(1))s
,
but this is very far from being proved.
By replacing the rst two colors by a new color (in a
k-coloring R
k
(s
1
, s
2
, , s
k
)), we have:
R
k
(s
1
, s
2
, , s
k
) R
k1
(R(s
1
, s
2
), s
3
, , s
k
).
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Outline
1 Introduction
2 The Four Problems
3 Classical Ramsey Number
4 Graph Ramsey Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Denition of Graph Ramsey Numbers
Graph Ramsey theory has grown enormously in the last two
decades to become presently one of the most active areas in
Ramsey theory.
Denition 4.1
Let G and H be two graphs. The Ramsey number R(G, H) is
the smallest integer r such that in any red-blue coloring on the
edges of K
r
on r vertices, there exists either a red G or a blue
H as a subgraph.
This denition is equivalent to the following:
Denition 4.2
Let G and H be two graphs. The Ramsey number R(G, H) is
the smallest integer r such that every graph F of order r will
satisfy the following condition: either F G or F H.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Chvtal-Harary bound
We can write this denition in a dierent form...
Let F (G, H) : every red-blue coloring of the edges of F
produces either a red G or a blue H.
The Ramsey number
R(G, H) =min{r : K
r
(G, H)}.
Let (H) be the chromatic number of graph H, and c(G) be the
order of the largest component if graph G.
Chvtal and Harary (1972):
R(G, H) ((H) 1)(c(G) 1) +1,
since F =((H) 1)K
(c(G)1)
G and F H.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Examples
Example 1. Show R(P
3
,C
3
) =5.
Proof.
Consider K
4
=2K
2
C
4
. Thus, 2K
2
P
3
and C
4
C
3
.
So, R(P
3
,C
3
) 5.
To show the upper bound, consider any 2-coloring on the
edges of K
5
so that no red P
3
. This means that there are
at most two red edges. This implies that there exists a
blue C
4
in K
5
. So, R(P
3
,C
3
) 5.
Thus, R(P
3
,C
3
) =5.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Examples
Example 2. Show R(K
1,3
, K
3
) =7.
Proof.
Consider F =2C
3
. Then, F K
1,3
and F K
3
.
So, R(K
1,3
, K
3
) 7.
To show the upper bound, consider any 2-coloring on the
edges of K
7
. If there is no blue K
3
then we have a red K
3
(by R(3, 3) =6). But if we have a red K
3
then each vertex
v in this K
3
is adjacent to the four remaining vertices with
blue edges. This forces either a red K
1,3
or a blue K
3
. So,
R(K
1,3
, K
3
) 7.
Thus, R(K
1,3
, K
3
) =7.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Tree-Complete Ramsey
Prove that
R(T
n
, K
m
) =(n 1)(m1) +1.
(Chvtal 1977)
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Path-Path & Cycle-cycle Ramsey
The determination of Ramsey numbers R(G, H) has been
studied for various combinations of graphs G and H.
R(P
n
, P
m
) =n +m/2 1, n m2.
(L. Gerncser, A. Gyrfs 1967)
R(C
n
,C
m
) =

2n 1,
for 3 mn, m odd; (n, m) =(3, 3);
n 1+
m
2
,
for 4 mn; m and n even; (n, m) =(4, 4);
max{n 1+
m
2
, 2m1},
for 4 mn, m even and n odd.
(V. Rosta 1973, R.J. Faudree and R.H. Schelp 1974,
Karolyi & Rosta 2001)
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Cycle-Complete Ramsey
R(C
n
, K
m
) =(n 1)(m1) +1,
for n m
2
2 [Bondy, Erds 1972],
for n >3 =m [Faudree, Schelp 1974],
for n 4 =m [Yang, Huang, Zhang 1999],
for n 5 =m [Bollobs, Jayawardene,
Yang, Huang, Rousseau, Zhang 2000]
for n 6 =m [Schiermeyer 2003],
for n m7 with n m(m2) [Schiermeyer 2003],
for n 7 =m [Chen, Zhang 2006],
for n 4m+2 and m3 [Nikiforov 2005].
It was conjectured it is true for all n m3 except
n =m=3.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Path-Wheel Ramsey
For n 3 consider graph F =2K
n1
. Clearly, F P
n
and
F W
4
. This implies R(P
n
, W
4
) 2n 1. For wheel W
5
,
consider graph F =3K
n1
. Clearly, F is a (P
n
, W
5
, 3n 3)-good
graph and so R(P
n
, W
5
) 3n 2.
Theorem 4.3
[Surahmat, etb 2001] For all n 3, R(P
n
, W
4
) =2n 1 and
R(P
n
, W
5
) =3n 2.
Proof.
Suppose F be a (P
n
, W
4
, 2n 1)-good graph.
Let P be a longest path in F with endpoints p
1
and p
2
.
Obviously, zp
1
, zp
2
E(F) for each z V (F)\V (P).
Let X =V (F)\V (P) and Q be a longest path in F[X].
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Path-Wheel Ramsey
Let q
1
and q
2
be its endpoints. Since |V (F)| =2n 1 and
the longest path in F is of length n 1 then there exists
a vertex w V (P) V (Q) such that w is independent to all
endpoints p
1
, p
2
, q
1
and q
2
.
Thus, we have W
4
with w as a hub and {p
1
, p
2
, q
1
, q
2
} as
rims, a contradiction. This concludes the proof.
These Ramsey numbers still remain the same when we replace
W
4
and W
5
by W
6
and W
7
respectively. Preciously, we have the
following theorem.
Theorem 4.4
[etb 2002] R(P
n
, W
6
) =2n 1 if n 6 and R(P
n
, W
7
) =3n 2 if
n 7.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Path-Wheel Ramsey
Then, a natural question immediately follows from the above
results: For all n m, is it true that R(P
n
, W
m
) =2n 1 if m
even and R(P
n
, W
m
) =3n 2 if m odd ?
By employing a generalised version of the previous method, we
could show that the above assertion is true if n
m
2
(m2).
Precisely, we have:
Theorem 4.5 (etb, Surahmat 2001)
If n
m
2
(m2) and m4 even then R(P
n
, W
m
) =2n 1.
Theorem 4.6 (etb, Surahmat 2001)
If n
m1
2
(m3) and m5 odd then R(P
n
, W
m
) =3n 2.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Path-Wheel Ramsey
This result has been rened by Yaojun Chen, Yunqing Zhang
and Kemin Zhang (2002) by showing that:
Theorem 4.7
1 R(P
n
, W
m
) =2n 1 for m even and n m1 3,
2 R(P
n
, W
m
) =3n 2 for m odd and n m1 2.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Path-Wheel Ramsey
For n <m the situation is dierent. Here we present our
knowledge on this.
Theorem 4.8
For all m6,
R(P
4
, W
m
) =

m+2 if m0, 2 mod 3,

m+3 if m1 mod 3.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Path-Wheel Ramsey
Proof.
Let m6 and m0 or 2 mod 3. Clearly, K
1,m
is a
(P
4
, W
m
, m+1)-good graph and hence R(P
4
, W
m
) m+2.
Next, we shall show that R(P
4
, W
m
) =m+2.
Let F be a graph of order m+2 containing no P
4
. Since
the largest path in F is of length 2, each component of F
must be of the form of either a star K
1,r
, a triangle C
3
, an
edge K
2
, or an isolated point. Clearly, in any situation we
will have a W
m
in F with any vertex of degree 1 or 0 in F
as the hub of W
m
. The second case is proved similarly by
considering
m+2
3
K
3
as a (P
4
, W
m
, m+2)-good graph.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Path-Wheel Ramsey
The similar method above can be used to show the following
result.
Theorem 4.9
For all m8,
R(P
5
, W
m
) =

m+3 if m0, 2, 3 mod 4,

m+4 if m1 mod 4.
Problem 4.10
Determine the Ramsey number R(P
n
, W
m
) for n <m1 in
general.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Star-Wheel Ramsey
Surprisingly, for n 3 the Ramsey numbers
R(S
n
, W
5
) =R(P
n
, W
5
), but the R(S
n
, W
4
) =R(P
n
, W
4
).
Theorem 4.11 (Surahmat, etb 2001)
For all n 3,
R(S
n
, W
4
) =

2n 1 if n odd,
2n +1 if n even.
However, ...
Theorem 4.12 (Chen, Zhang, Zhang, 2004)
R(S
n
, W
6
) =2n +1, for all n 3.
Let m6 be even, n =km/2+2 k 2. Let G = H K
n1
,
where H =(k +1)K
m/2
. Obviously, G has order 2n+m/23 and
(G) =n2 and hence G S
n
. It is not dicult to see G W
m
.
Thus, R(S
n
, W
m
) >2n +m/22 if n =km/2+2, for k 2.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Star-Wheel Ramsey
Furthermore, Surahmat, etb and Broersma (2002) showed that
the following theorem holds for stars and odd wheels:
Theorem 4.13 (Surahmat, etb and Broersma, 2002)
For all n 2m4, m5 and m odd, R(S
n
, W
m
) =3n 2.
This result was improved by Chen, Zhang, Zhang, European
Journal of Combinatorics 25 (2004) 1067-1075:
Theorem 4.14 (Chen, Zhang, Zhang, 2004)
For all n m1 2 and m odd, R(S
n
, W
m
) =3n 2.
Hasmawati, etb, Assiyatun, JCMCC 55 (2005), 123-128
improved...
Theorem 4.15 (Hasmawati, etb, Assiyatun, 2005)
For all n (m+1)/2, m odd and m5, R(S
n
, W
m
) =3n 2.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Star-Wheel Ramsey
With a star-like tree we mean a subdivided star (which is not a
path), i.e., a tree with exactly one vertex of degree exceeding
two.
We denote by Y
n,l
1
,l
2
,...,l
k
the star-like tree consisting of a P
n
,
and k additional mutually disjoint paths P
l
1
, P
l
2
, . . . , P
l
k
all
attached by one edge from one of their end vertices to the same
end vertex of the P
n
. Then, we have the following theorem.
Theorem 4.16 (Surahmat, etb, Broersma, 2002)
R(Y
n,l
1
,l
2
,...,l
k
, W
m
) =3(n +
k

i =1
l
i
) 2 for n 2m4, n l
i
for
each i =1, 2, ..., k, m5 odd, and
m
2
+1
k

i =1
l
i
.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Star-Wheel Ramsey
We conclude this subsection by listing some open problems.
Problem 4.17
Determine the Ramsey number R(S
n
, W
m
) for m even and
n m1 7.
Problem 4.18
Determine the Ramsey number R(Y
n,l
1
,l
2
,...,l
k
, W
m
) for m4
even.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Tree-Wheel Ramsey
etb, Surahmat, Nababan, Miller (2002), Graph. Comb. 18:4
(2002), 717-721 obtained the Ramsey number for trees versus
wheels:
Theorem 4.19 (etb, Surahmat, Nababan, Miller, 2002)
Let n 4 and assume that we are given a particular tree T
n
of
n vertices other than a star. Then, the Ramsey number
R(T
n
, W
4
) =2n 1.
Theorem 4.20 (etb, Surahmat, Nababan, Miller, 2002)
Let n 3 and assume that we are given a particular tree T
n
of
n vertices. Then the Ramsey number R(T
n
, W
5
) =3n 2.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Tree-Wheel Ramsey
In [Chen, Zhang, Zhang, Applied Mathematics Letters 17
(2004) 281-285], for a tree T
n
with (T
n
) n 3, we have:
Theorem 4.21 (Chen, Zhang, Zhang, 2004)
R(S
n
(1, 1), W
6
) =2n, for n 4
R(S
n
(1, 2), W
6
) =2n, for n 6 and n 0 (mod 3).
R(S
n
(3), W
6
) =R(S
n
(2, 1), W
6
) =2n 1, for n 6.
R
(
S
n
(1, 2), W
6
) =2n 1 for n 6 and n 0 (mod 3).
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Tree-Wheel Ramsey
Let m6 be an even integer, n =km/2+3, where k 2, and
G = H K
n1
, where H =(k +1)K
m/2
. Obviously, G is a graph
of order 2n +m/24. Since (H) =km/2 =n 3 and
(S
n
(1, 1)) =n 2, we can see that G S
n
(1, 1). On the other
hand, it is not dicult to check that G W
m
. Thus,
R(S
n
(1, 1), W
m
) 2n +m/23 if n =km/2+3, k 2.
In general, by modifying the examples above, we can show for
even m, R(T
n
, W
m
) depends on the values of n and m if (T
n
)
is large enough. Since R(P
n
, W
m
) =2n 1 for even m and
n m1 3, we believe R(T
n
, W
m
) =2n 1 for m even and
n m1 if (T
n
) is small.
Problem 4.22
Characterize trees T
n
with R(T
n
, W
m
) =2n 1 for m even and
n m1.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Tree-Wheel Ramsey
To conclude this section, we present the remaining open
problems.
Problem 4.23
Determine the Ramsey number R(T
n
, W
m
) for m7 odd.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Forest-Wheel Ramsey
In [Surahmat, etb 2002], we consider the Ramsey number for a
linear forest versus a wheel. With a linear forest we mean a
disjoint union of paths of unnecessarily the same lengths. The
followings are the results.
Theorem 4.24
If l
m
2
(m2), m4 even then R(F
l
, W
m
) =2l 1, where F
l
is
a linear forest of l vertices.
Theorem 4.25
If l
m1
2
(m3) and m5 odd then R(F
l
, W
m
) =3l 2, where
F
l
is a linear forest of l vertices.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Forest-Wheel Ramsey
Furthermore, we have the following theorem for m odd.
Theorem 4.26
If l m5 and m odd then R(F
l
, W
m
) =3l 2, where F
l
is a
linear forest of l vertices.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Cycle-Wheel Ramsey
Exercise.
Find the Ramsey number R(C
6
, W
4
).
Find The Ramsey number R(C
7
, W
4
).
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Cycle-Wheel Ramsey
Surahmat, etb, Broersma, INTEGERS: Electron. J. Comb.
Number Theory 4 (2004), #A10 gave the following result:
The Ramsey number of cycle C
n
versus W
4
is
R(C
n
, W
4
) =2n 1, for n 5.
Find The Ramsey number cycle C
n
versus W
4
is
R(C
n
, W
5
) =3n 1, for n 5.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Cycle-Wheel Ramsey
Surahmat, etb, Tomescu,
Discrete Math. 306 (2006), 3334-3337 showed that:
R(C
n
, W
m
) =2n 1 for even m and n 5m/21.
Surahmat, etb, Tomescu,
Graph & Combinatorics 24 (2008), 53-58 showed that:
R(C
n
, W
m
) =3n 2 for odd m5, and n >
5m9
2
.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Ramsey for Union Graphs
Question.
Establish some connection between R(G
i
, H
j
) with R(G
i
, H
j
),
R(G
i
, H
j
) or R(G
i
, H
j
).
Hasmawati, etb, Assiyatun,
Discrete Math. 308 (2008), 2046-2049 gave the upper bound
for R(G
i
, H
j
), as follows.
Theorem 4.27 (Hasmawati, etb, Assiyatun, 2008)
For connected graphs G and H, and k 1,
R(kG, H) R(G, H) +(k 1)|V (G)|.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
The proof for Theorem 4.27
Proof.
We prove R(kG, H) R(G, H) +(k 1)|V (G)| by induction on k.
k =1 it is trivial.
Assume the theorem holds for any r <k.
Let F be a graph with order R(G, H) +(k 1)|V (G)|.
Suppose F H. By induction hypothesis, F (k 1)G.
Now, write T =F\(k 1)G. Thus, |V (T)| =R(G, H). Since
T H, then T must contain G. Hence, F contains
(k 1)G G.
Therefore, we have R(kG, H) =R(G, H) +(k 1)|V (G)|.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Ramsey for Union Graphs
Previously, etb, Hasmawati, Assiyatun,
Discrete Math. 306 (2006), 3297-3301 showed these results.
Theorem 4.28 (etb, Hasmawati, Assiyatun, 2006)
If m is odd and n
m+1
2
3, then
R(kS
n
, W
m
) =3n 2+(k 1)n.
Proof. Since F
1
=K
kn1
2K
n1
contains no kS
n
and its
complement contains no W
m
. The upper bound is from
Theorem 4.27.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Ramsey for Union Graphs
Theorem 4.29 (etb, Hasmawati, Assiyatun, 2006)
For n 3,
R(kS
n
, W
4
) =

(k +1)n if n is even and k 2,

(k +1)n 1 if n is odd and k 1.
Consider F =(Hkn2
2
+K
1
) H
n
2
. Clearly, graph F has (k +1)n1
vertices and contains no kS
n
. Its complement contains no W
4
.
Hence, R(kS
n
, W
4
) (k +1)n, for k 2.
Let n be odd. Consider F
3
=K
kn1
K
n1
. Clearly, the graph
F
3
has order (k +1)n 2, without containing kS
n
and F
3
contains no W
4
. Hence, R(kS
n
, W
4
) (k +1)n 1.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Ramsey for Union Graphs
Theorem 4.30 (etb, Hasmawati, Assiyatun, 2006)
Let n
i
n
i +1
for i =1, 2, . . . , k 1. If n
i
(n
i
n
i +1
)(m1) for
any i , then R(

k
i =1
T
n
i
, K
m
) =R(T
n
k
, K
m
) +

k1
i =1
n
i
for an
arbitrary m.
Proof.
Let n
i
n
i +1
and n
i
(n
i
n
i +1
)(m1) for any i . Since
F =(m2)K
n
k
1
K

k
i =1
n
i
1
has no

k
i =1
T
n
i
and its
complement contains no K
m
, then
R(

k
i =1
T
n
i
, K
m
) (m1)(n
k
1) +

k1
i =1
n
i
+1.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Ramsey for Union Graphs
We x m and apply an induction on k. For k =2, we show
that R(T
n
1
T
n
2
, K
m
) =(m1)(n
2
1) +n
1
+1. Let F
1
be a
graph with |F
1
| =(m1)(n
2
1) +1+n
1
. Suppose F
1
K
m
.
Write n
1
n
2
=q 0, then we obtain
|F
1
| =(m1)(n
1
q 1) +n
1
+1 =
(m1)(n
1
1) q(m1) +n
1
+1 or
|F
1
| =(m1)(n
1
1) +1+[n
1
(n
1
n
2
)(m1)]. Noting
n
1
(n
1
n
2
)(m1) 0, it can be veried that
|F
1
| (m1)(n
1
1) +1 i.e. |F
1
| R(T
n
1
, K
m
). Hence,
F
1
T
n
1
.
Now, let A =F
1
\T
n
1
, and H =F
1
[A]. Then
|H| =(m1)(n
2
1) +1. Since H contains no K
m
, then
H T
n
2
. Therefore, F
1
T
n
1

T
n
2
.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Ramsey for Union Graphs
Next, assume the theorem holds for all r <k, namely
R(

r
i =1
T
n
i
, K
m
) =(m1)(n
r
1) +

r 1
i =1
n
i
+1.
We shall show that
R(

k
i =1
T
n
i
, K
m
) =(m1)(n
k
1) +

k1
i =1
n
i
+1. Take an
arbitrary graph F
2
with order (m1)(n
k
1) +

k1
i =1
n
i
+1.
Suppose F
2
contains no K
m
. By induction, F
2
contains

k1
i =1
T
n
i
.
Writing B =F
2
\

k1
i =1
T
n
i
, and Q =F
2
[B]. Then
|Q| =(m1)(n
k
1) +1. Since Q contains no K
m
, then Q
contains T
n
k
. Hence F
2
contains

k
i =1
T
n
i
. Therefore, we
have R(

k
i =1
T
n
i
, K
m
) =(m1)(n
k
1) +

k1
i =1
n
i
+1.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Ramsey for Union Graphs
Theorem 4.31 (Hasmawati, etb, Assiyatun, 2008)
If n is odd and n 5, then R(kS
n
, W
m
) =R(S
n
, W
m
) +(k 1)n
for m=2n 4, 2n 6 or 2n 8.
Proof.
By Theorem 4.27, we have
R(kS
n
, W
m
) R(S
n
, W
m
) +(k 1)n.
For m=2n 4 we consider F K
kn1
K
n2,n2
. The
graph F has (3n 5) +(k 1)n vertices and contains no
kS
n
. Observe that F contains no W
m
. Hence,
R(kS
n
, W
m
) (3n 4) +(k 1)n =R(S
n
, W
m
) +(k 1)n for
m=2n 4.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Ramsey for Union Graphs
In showing the lower bound for m=2n 6 or 2n 8, we
use F
1
K
kn1
[

n3
2

K
2
+

n3
2

K
2
]. The graph F
1
has
(3n 7) +(k 1)n vertices and contains no kS
n
. We
observe that F contains no W
m
. Therefore, we have
R(kS
n
, W
m
) (3n 6) +(k 1)n =R(S
n
, W
m
) +(k 1)n for
m=2n 6 or 2n 8.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Ramsey for Union Graphs
Theorem 4.32 (Hasmawati, etb, Assiyatun, 2008)
Let H and G
i
be connected graphs with |G
i
| |G
i +1
|,
i =1, 2, . . . , k 1. If |G
i
| >(|G
i
| |G
i +1
|)((H) 1) and
R(G
i
, H) =((H) 1)(|G
i
| 1) +1 for each i , then
R(

k
i =1
G
i
, H) =R(G
k
, H) +

k1
i =1
|G
i
|.
Proof.
Let |G
i
| =n
i
for i =1, 2, ..., k. We will show that
R(

k
i =1
G
i
, H) =((H) 1)(n
k
1) +

k1
i =1
n
i
+1 if
R(G
i
, H) =((H) 1)(n
i
1) +1.
Consider F ((H) 2)K
n
k
1
K
s
where s =1+

k
i =1
n
i
.
This graph F has ((H) 1)(n
k
1) +

k1
i =1
n
i
vertices and
contains no

k
i =1
G
i
. Furthermore, its complement contains
no H. Then, we have
R(

k
i =1
G
i
, H) ((H) 1)(n
k
1) +1+

k1
i =1
n
i
.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Ramsey for Union Graphs
Next, we will show that
R(

k
i =1
G
i
, H) ((H) 1)(n
k
1) +1+

k1
i =1
n
i
. First, we
show that R(G
1
G
2
, H) ((H) 1)(n
2
1) +n
1
+1. Let F
1
be a graph with |F
1
| =((H) 1)(n
2
1) +1+n
1
. Suppose
F
1
contains no H and let n
1
n
2
=q. Then n
2
=n
1
q
and |F
1
| =[((H) 1)(n
1
(q +1) +1] +n
1
. We can write
|F
1
| =((H) 1)(n
1
1) +1+n
1
(n
1
n
2
)((H) 1). Since
n
1
(n
1
n
2
)((H) 1) >0, then
|F
1
| ((H) 1)(n
1
1) +1 =R(G
1
, H). Hence, F
1
contains
G
1
.
Write T =F
1
\G
1
. Thus |T| =((H) 1)(n
2
1) +1. Since T
contains no H and |T| =((H) 1)(n
2
1) +1, it follows
that T contains G
2
. Therefore, F contains G
1
G
2
. Hence,
we have R(G
1
G
2
, H) ((H) 1)(n
2
1) +n
1
+1.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Ramsey for Union Graphs
Now, by induction, assume the theorem holds for any
r <k, namely
R(

r
i =1
G
i
, H) ((H) 1)(n
r
1) +1+

r 1
i =1
n
i
. We shall
show that R(

k
i =1
G
i
, H) ((H) 1)(n
k
1) +1+

k1
i =1
n
i
.
Let F
2
be a graph with
|F
2
| =((H) 1)(n
k
1) +

k1
i =1
n
i
+1. Suppose F
2
contains
no H. By induction, F
2
contains

k1
i =1
G
i
. Let
B =F
2
\

k1
i =1
G
i
, and Q =F
2
[B]. Then
|Q| =((H) 1)(n
k
1) +1 =R(G
k
, H). Consequently, Q
contains G
k
. So, F
2
contains

k
i =1
G
i
. Therefore,
R(

k
i =1
G
i
, H) ((H) 1)(n
k
1) +

k1
i =1
n
i
+1.
Hence, we have
R(

k
i =1
G
i
, H) =((H) 1)(n
k
1) +

k1
i =1
n
i
+1 or
R(

k
i =1
G
i
, H) =R(G
k
, H) +

k1
i =1
n
i
.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Ramsey for Jahangir
For m2, the Jahangir graph J
2m
is a graph consisting of a
cycle C
2m
with one additional vertex adjacent alternatingly to
m vertices of C
2m
. For example, this gure shows a Jahangir
graph J
16
.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Ramsey for Jahangir
Kashif Ali, etb, J. Combin. Math. Combin. Comput. 65
(2008), 113 - 120 showed:
Theorem 4.33
R(P
n
, J
2m
) =n +m1 for n 2m+1 and m=3, 4 or 5.
We are also able to determine the Ramsey number R(kP
n
, J
2m
),
for any integer k 2, m2.
Theorem 4.34
R(kP
n
, J
4
) =kn +1, for n 4, k 1, except for (n =4, k =1).
Theorem 4.35
R(kP
n
, J
2m
) =kn +m1, for any integer n 2m+1 if m=3, 4
or 5; and for n (4m1)(m1) +1 if m6, where k 2.
Introduction
The Four
Problems
Classical
Ramsey
Number
Graph
Ramsey
Numbers
P-P & Cy-Cy
Cy-Comp
Path-Wheel
Star-Wheel
Tree-Wheel
Forest-Wheel
Cy-Wheel
Union graph
Jahangir
Exercises
Exercise.
We know that R(P
n
, W
4
) =2n 1 and R(T
n
, W
5
) =3n 2, for
n 3.
1 Find R(P
n
, kW
4
) for k =2, n 3. Then, generalize your
result (if possible) for k 2.
2 Find R(T
n
, kW
5
) for k =2, n 3. Then, generalize your
result (if possible) for k 2.
3 Find R(T
n
, W
4
W
5
), for n 3. Then, generalize your
result (if possible) to nd R(T
n
,

k
i =1
W
s
i
), for k 2.
TERIMA KASIH