Guichard-Combinatorics-Graph-Theory · Problem 5.7.7

Graph Theory

Mathematics — Probability · connectivity

Problem

Suppose

\lambda(G) = k > 0

. Show that there are sets of vertices

U

and

V

that partition the vertices of

G

, and such that there are exactly

k

edges with one endpoint in

U

and one endpoint in

V