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

disconnected Its 1 2 3

Defn T
9
IEP
edge Eachedges has sends
2
loop 2

[Link]
otalnofedge r1 2 Components
Largest connected part

di
 It Ex 1
K2 Kz kg 1
Ks

F kn
gug
bro
AUB AMB A B 0

complete bipartite
of
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 re

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
as vertices
People
Bkn C Psx
friends Blue Red Δ
strangus
Monochromatic Δ

TP the enistance monochromatic

of
in re
any edgeRcolony of B
2 colours
by
2223 1 5
KG
with edges colound BIR
Affian As
Az

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
VxVy y
are all green or Blue
They
V V2 V6 forms a
kg coloured cortth
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 MC Δ

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 Δ Double
counting
Count the dichromatic
angles

Monochtic Each monochromatic Δ has

non 2

dichromatic angles Bad 2

good
Total no
of Δ 1
6 56 200

At each verton we have 5

 ges
R B Bad C
5 0 0
4 1 4
3 2 6

Maximum possible bad L's at a vertex 6

Manin bed L's in 6 6
possible G
Manim bad 0 in
possible
G 611 180

at least 20 18 2
good Δ

4
few
No two adjacent vertices has he
Same colour
91 2
did 92
fig 93
I
o 3
scotus
6 oo
28600 gx

fg o

5
a

3
6 g uggs
 2 3 4 24
g 4

sot Associate a
tuple [Link] [Link]
Xie 2 [Link] is coloured in
G by
in
Gaby and ing
2
by
such 2 3 4 24
of Tuples
Now associate 24 diff colours with 24
taples
colour version of
accordingly
x
4,2 is associated with both
eg edge say
Vi V then they will be coloured the
by
same colour
This
of G4
is a
good colouring
if possible [Link] are adjacent are

of the same colour

7 the same x Y 2 associated with
taph
Viev

49
301
As E
g Ecg UE g UELgs Tuj most be
an
edge of atleast gear 93
of 9
one or

atleast
of the graph G 92 43 the
in one or

diff colour
vertices Vi Vg must have
Contrad
This colouring is good
 graph
3
Let be the graph
g each
with vertices as councilors and edges if theydo not
know other Consider 2
groups of Counciler AUB AMB V
For each such partition Edges with
f AUB bothends
m B
ph
in Aa bothend
pts
Consider a
partition AUB with min AUB

Claim This the required partition

is

FTSOC let if possible P Q R E A PQ PR EEG

Cie P does not know QAR both Let PTC Ecg
shift P in B

A
0 B 0 A B
A B

A
0
B
R

A B

f A'UP
f AUB 2

A BI
A B
a'uB 1 1
f AUB flave
2
f
Centred to minimality of AUB
 8
5

A A B B C C2 D Dz E Ez
We join edge if 2
people
are
asleep sim

A Time period when Prof A is alseep for 1ˢᵗ to

Ac Time interval ti 2ⁿᵈton Isoon
FTSOC if possible assume no 3
ofthem are
asleep sim

Graph with 10 vertices

3 Edges E 10 edges

Cyclic graph
E
p Tos If it is notyelic
then no
of edges no
of vertices
Be Vertion e 1

Δ
a

Let A
Cy
on
Tapti
or

Bn Cy
neighbours
Sim
A B C are
asleep

β
Nes cand
for such a
path is
Each vertex trust has one
one
edge attestincoming
outgoing
E Isolated verten is one which has
5 all 4 edge in same

Is arxx direct in
outgory 4 incong
The situations where such pathdo not
exists is one isolated verten or 2 isolated vertices
Total no of circuits 21
Total ro of amounts with 1 isolated rester 5 2
slangGedges
Total no of arrants with exactly 2 isolated vertices
E 23
[Link]
Effit lot edget

isolated vertices
A_ Only 2
possible
are

A In
Youtgay
C
21 26
good circults
The 5 2 160
no
of
1024 640 160 544

1 a 13
v
E D TD 11
E
II D
tree is connected
Up angelic graph

tr o

1V eI
Euler's Eq f e 2
f 2

f 1 v ett
noed
Frpeated
v2 V No edge is repeated

civant of odd ugh

If