In this paper we explore various properties of random bipartite graphs. These structures naturally correspond to independent families, which are very important in various set-theoretic constructions. We investigate their robustness, universality, possibility of factorization and maximality.