Let G LV El be an undirected graph with no

isolated vertices
G has a Euler Circuit Trail if there is
a circuit trail in G that traverses every
Passesthrough
edge in Gl exactly once

Example I ea
ez
a a E G
eg
AE ezezec.ese e egegA er e4

es es

Theorem G1 has an Euler circuit iff

i G is connected
Cii Every vertex has an even degree

proof D If Euler Circuit then connected and even

degrees
i Vi Uzpath Vy.EU i i lv no repeated vertices
ii V veV degas even
a a sa can't

F
happen

qgy
ii
ooo
 n
g l

proof D If Euler Circuit then connected and even

degrees

OUTLINEI Induction on edges

show e I and e 2 true
Assume true for e ne k true
Prove n ktl true
1 Build some circuit
case Missing Edges
2 Decompose into components
3 Rebuild Circuit

Base e L e 2

ooo a

IH net edges true e K ti has circuit

strong
induction
1 Circuit Euler
G
I Tgc
1 1
 C

i
Euler
Circuit

t.gr o
a
Ii's
Voice note for
explanation

Let G 4v E7 be a directed graph

in out
feudegCvt
uEidv1teEuodlv
idla
o od
ay.b o a 2
j id b 2 od b O
c idle 2 od c 2
loop

ridult
Odastl
C C
99
od id
Rotating Drum
How can we place a
f 1 1
to Binary sequence on
8 o this wheel so that every
l
f 1
I
reading will be different

Euler Circuit
8 bit String requires IVI 4

is io.IQ
r
011
3 Ith
too
010
In
J haveto be same
10 can'tgo to 11
O 001 Of

t t t t t
lO 00 700 701 710 501
t EE T I 8
1 00 L LO I
p p p

lets putthis
00010111 in the drum

Br
1 O O O I 0
I 0
o o I o I
I

il go O l O 1 I

O l
o
Ja te
I I 1