The weak saturation number of \boldsymbol{K_{2, t}}

Abstract: For two graphs

G

and

F

, we say that

G

is weakly

F

-saturated if

G

contains no copy of

F

as a subgraph and one could join all the nonadjacent pairs of vertices of

G

in some order so that a new copy of

F

is created at each step. The weak saturation number

m a t h r m w s a t (n, F)

is the minimum number of edges of a weakly

F

-saturated graph on

n

vertices. In this paper, we examine

m a t h r m w s a t (n, K_{s, t})

, where

K_{s, t}

is the complete bipartite graph with parts of sizes

s

and

t

. We determine

m a t h r m w s a t (n, K_{2, t})

, correcting a previous report in the literature. It is also shown that

if

g c d (s, t) = 1

and

, otherwise.

This page was built for publication: The weak saturation number of $\boldsymbol{K_{2, t}}$