Quasirandom bipartite graph
= Quasirandom bipartite graph
For a <biregular graph> of <edge density of a bipartite graph> $\gamma$, small rectangular discrepancy, a <box norm> fourth power close to $\gamma^4$, and a small second <singular value> of the <normalized adjacency operator of a bipartite graph> are equivalent notions of quasirandomness, with quantitative bounds independent of the part sizes. Centering the adjacency function removes the constant singular component.