$K_{s,t}$-saturated bipartite graphs

Wenying Gan, Dániel Korándi, Benny Sudakov

An $n$-by-$n$ bipartite graph is $H$-saturated if the addition of any missing edge between its two parts creates a new copy of $H$. In 1964, Erdős, Hajnal and Moon made a conjectur…