Nick Stocchero

1. Consider the (undirected) graph Km,n . What conditions must be

imposed to guarantee that Km,n is an Eulerian digraph? Prove your
result to be true.
• Case 1: m,n are even
– Proposition: For an undirected, complete, bipartite graph to be
an Eulerian digraph, both partition classes must contain an
even number of vertices
Pf: Assume you have at least 1 partition class which has an
odd amount of vertices. By the definition of a complete
bipartite graph, the degree of each vertex in a given partition
class is equal to the number of vertices in the opposite partition
class. To be an Eulerian digraph, every vertex from both
partition classes must meet the following condition:
indeg(Vi ) = outdeg (Vi ). Contradiction!
If at least one partition class is odd, that means at least one
partition class will have all verticies with an odd degree, which
cannot meet the criteria: indeg(Vi ) = outdeg (Vi ) under any
circumstance 
• Case 2: (m or n is odd) OR (m and n are both odd)
– Proof by contradiction. This is impossible. By the definition of
Eulerian Digraph, each vertex must have indeg(Vi ) =
outdeg(Vi ). Odd degreed vertices cannot meet this condition
under any circumstance.
∴ m and n must be even in order to guarantee that an undirected,
complete, bipartite graph is an Eulerian digraph.
2. When Km,n is an Eulerian digraph, it has a decomposition in ?
edge-disjoint cycles. Prove.

• Prop: When Km,n is an Eulerian digraph, it has a decomposition of

4-edged disjoint cycles.
Pf: From part A, we can conclude that the smallest complete
bipartite digraph is K2,2 . 2 is the smallest even natural number
greater than 0 that satisfies the conditions of part A. So, we can say
that the smallest cycle is K2,2 (which has 4 edges).
∴ Any bipartite dicycle will have edges that are a multiple of 4, and
in that case, can be decomposed into it’s smallest cycle, which is 4.
∴ Proposition is true: When Km,n is an Eulerian digraph, it has a
decomposition of 4-edged disjoint cycles.