Our main result implies the following easily formulated statement. The set of edges E of every finite bipartite graph can be split into poly(log |E|) subsets so the all the resulting bipartite graphcs are almost regular. The latter means that the ratio between the maximal and minimal non-zero degree of ... more >>>

We provide a digest of the paper of Fei and Rubinfeld (arXiv 2026), which provides an alternative analysis of the Bipartite Tester of Goldreich and Ron ({\em Combinatorica}, 1999), which operates in the bounded-degree graph model.
Loosely speaking, on input an $n$-vertex graph $G$, the tester selects few vertices, ... more >>>