Recall the defth of bipartite graphs.

let a be a bipartite graph with partite sets X and Y .

We then

have the following characterization for bipartite graphs.

there (ing) : A graph is bipartite if and only if it has no

odd cycle.
Roof: G be
let a
bipartite graph- · ·

the vertices in any cycle in G alternates

· ·

blu the two sets of the bipartition, so

·
·

every return to the original partite set

happens after an even steps - G has no odd cycle

-

,
conversely

with
let G be a
graph no old cycle.
to prove : G is bipartite (i , we need the desired partite sets
Xand Y)
 let
h be a vatex in a nax-trivial component 1
.
Cshortest)
For each vev(n), let fiv) be the minimum length U-V path.
swice H is connected , fev) is defined vev(n).

let X =VEVCH) : f(v) is even) and Y =

[VEVCH) : fN) is odd)
Claims: X and Y are independent
.

suppose not v
~ odd
VVEX St w/EECH)
car:
env
=

then 7 a n-Upath which is even

,
VIEE(H)
and vu path which constitute an
which is even
, together
odd closed walk in = 7 a odd in G (by Lemma 2)
cycle
a untradiction
.

cre:

Exercisethe proof
-
is
VNEY Str'eE(K)
symmetric to case 1 -
·
·
d

v
contradiction
again a

=> clains is true and therefore, G = (XVY, E) is a

bipartite graph.
-
 whythemByteaboveheremto checkwhethera
a

ins

odd not This is much easier than verifying whether

an
cycle or .

all bipartitions of the graph is independent .

the union of graphs G , G, ...

G written as GuazU -..
Uak is the

DEL
,

grape with Vertex set VII)

i= 1
and the ede set
b b b
a · a · a ·

eg
:
-
F
Y

d · d · d ·

AreaScenario : consider an traffic

air
systems with airlines-
has round-trip direct service
suppose that each pair of cities a

airline that airline can schedule a

from atleast one :

suppose no

of cities Then, in terms of k what is the

cycle through an odd number .

maximum # cities in the system?

the above example >
- 2 airlines can operate on 4 cities
.
 n vertices
Question? Isthis the
maxiimure a complete graph an

Theorems : The complete graph In can be expressed as the union

.
n12K
of k bipartite graphs if and
only if
A roof: Based on the induction
an k

Base
case :
E1 since
ky is a
triangle ,
which is not
bipartite,
and 1 is a
tipartite, we have n -212 = 2.

implications here).
Indudestep : K71 (we prove both the

first , suppose that kn can be expressed as the unias of bipartite graphs.

G , UGU UGk where for each Lel] Gi is bipartite
i .. kn = ...

let v(k) = XrY! Then , partition N(Kn) into two sets X and Y St
*
XEX and Y1Y. X

van an
then,
G GzU ....
LG can cover KIX :

Grau
Illi Guazu . .

-UGK- can also cover

Kyl
-

Y Yo
 *
: By the induction hypothesis ,
we have 2 and 14112+
-n = (xVYl < 2112k +
=
24
-

conversely , suppose that n12

then partition o vertices into two sets X and Y where

#[2 and 'M12k+
induction be covered by using
By the hypothesis ,
K can -

bipartite graphs , say U, , H2, ...

HK-1 and similarly Kyl can

be covered by using graphs U1 He' , ...it

l-1 bipartite ,

X
Then for each Lesl , 2
, -
..
k -

13 M 42
4k / =

Gi =
Hiunt is a
bipartile graph.
and the
graph Gi with v(K) = XuY ,
>
-
GK
E(K) =
Say :
Yey] is also a
NEX,

bepartite graph In can be covered

>
->

by usingk bipartite graphs

=
H, 1 Hal
H
 Eulerian circuits
Recall the Konigsberg bridge
problem. .
(
What did the people of ·

wanted ?
Konigsberg
2

al in the
closed
a
containing the
all
edge
- Daph
Such a frail is known as an Eulerian trail or an Eulerian circuit
.

Further, is said to be Eulerian if it contains an

a
graph
Eulerian trail
.

What from Euler's solution to the

is the take
away Konigsberg
bridge problem ?
It provides his a condition for to be Fulerian !
-

necessary a
graph
ic , A graph is Eulerian > all Vertex
=

degrees have to be .
even

=
 what is another condition for an Eulerian graph ?
necessary
-

all the edges belong to the same

component of the
graph
.

(2)
-

It happens to be that the conditions ① and ② together is

Sufficient for a graph to be Eulerian I will see the proof .

soon)
Lemmet .

If every vert of a graph G has degree atleast 2

,
then G contains a cycle.
Lof: Let p be a maxisalath in .
G
(a path that is not contained in a longerpath)
let u be an end paint of P and be a neighbor of in p-

Now P is maximal · · · ·

=> it cannot be extended. I ul

a should
=> all neighbours .of
belong to p · · · · ·
U Ul 2
Since deglu) 2 ,
7 VFU'st VEVIP) and UreE(G)
=> the pation of P fromU to V together with the edge
uv form a in G
cycle
-