D
9 people diff no
of handshakes
0 1 2,3 4,5 6,7 8
M S A
a
Id
Note then landstill
will be no one
Ñ
c
Control
Mrs S has not don
8 handshakes
Mrs
Mrs f II
b
B
WLG let A did 8 handshakes
Mrs A hasdone 0 handshakes
WLG Mrs C has done 7 handshake
a memoir
7 Similarly We can
prove
hot no
of
people with
6 2 1 5,3 are
spouses
Mrs Smith must have done 4 handshakes
We can't out of 3 3 chessboard
go
1
808 6
3 000 1 8 3 4 9 2 7
3 30 3 3
cycle of length 8
Knights
can more
only along a
cycle 8 3 4 0 2 7
B W
61
W
Initial in B
And W β W
0W
BmoYossible
B B
1 B
B B W W B
[Link] Its 1 2 3
EIssftf. Def Eachedges has sends
[Link]
edge
loop 2
[Link]
otalnofedge r1 2 Components
Largest connected part
di
It Ex 1
K2 Kz kg 1
Ks
F Kn
gug
Yoo
AUB AMB A B
complete bipartite
ol
A B
42,3
Consider
any cycle
in
G
Even no ofvertices
4hak by
Suppose a
graph
does not have an odd
cycle
tune it is
a bipartite graph
Let if possible a as ay be an even
cycking
We consider partition V AUB
A an x is odd
B an n is even
Next each cycle in do same thing
We do the same
thing for openpath
For in I one
endpt in A
any edge graph
other in B
It's
Biporth Unsolved
for 300 yrs
3
41
B 2 6
2 24 3
3 5
4 7
3 Japan
these
Claim Eulerian path is possible 1 are
exactly 0 2 vertices of odd degree Restall even
e
V Iq VE VE K
odd
V1 Vk
odd
Even degrees odd odd
degree
E
5 5 1
2
rep vertices
IT 0 1 2,3 4,5 or 6 Do
t 21 7 28 to
D Do
a
3'00 8 3
at
or
each verter
Each verter has
f
1 2
degree 8
EulerianCircuit
mutual relation
A B B A A
K kn or
vertices
gx
People as
Bkn C
friends Blue Red Δ
strangus
Monochromatic Δ
TP the enistance monochromatic
F
of
o in re
any edgeRcolony of B
2 colours
by
2223 1 5
KG
with edges colound BIR
[Link] Az
As
Ag
Some 3 edges out this 5 has same colour
A As A A A As red
Wcg
re 6
An
I
off
RedΔ Red Δ Red Δ
AI
TM
Blue Δ A3AA6
x̅
Claim n 6 is the smallest number [Link] coloured
of M.C Δ
with 2 colours Existence
K2 Kz Ks Kg
I III a
19 to
7
We have Kiry edges coloured with 3 colours We need to
existence of MCD
prove
16 315 1
PHP some 6 edges must have
vernas By
the same colour red
say
voun um ned n 112 6
6
If any bevy is red for 1 acy
we a red Δ
v4 get Vously
V6 05
Suppose not None of is red
for x G
Valy y
are all green or Blue
They
V V2 V6 forms a
kg coloured certh
or Blue
Green
of a MCO
16 3 5 1
17 3 6 1 2
Kn is colound with 4 colours fl smallest on that
arm the MCO
An the smallest n
guarantees that
that
kn coloured with n colours has at least I
MCD
an 1 n an 1 1 1
anencan 1 1712
4 RR at
16 2 66
as 5 65 2
Nos 327
Ramsey
96
1958
assign 6 colours to 6 countries
Let us C 12 Cg
Consider
graph with 1978 vertices
Colove
edge my by
the colour of country with member be y
In yle C
x
Éy
K 1978 coloured with 6 colours
As 96 1958 1078 Fa MCD
a b b 4 c al of same colour belongsto the same
country
a Lb c a b b a c a c a
1 b c c b
b a C b c a
And all 3
from same
country
P.T When kg edges coloured with 2 colours
P T I attent 2 MC Δ
x
Graph B
No two adjacent vertices has he
Same colour
I
fly 195m
92
60 6 ffÉ
a
5 4
2colous
5
f a
o
3
6 9 uggs
5 4
