Guichard-Combinatorics-Graph-Theory · Problem 5.7.8

Graph Theory

Mathematics — Probability · connectivity

Problem

Find

\lambda(K_{m,n})

, where both

m

and

n

are at least 1. (

K_{m,n}

is the complete bipartite graph on

m

and

n

vertices: the parts have

m

and

n

vertices, and every pair of vertices, one from each part, is connected by an edge.)