Ramsey degrees of bipartite graphs: A primitive recursive proof

In this paper, we give a primitive recursive proof for a theorem that provides a measure of the extent to which a finite bipartite graph is a Ramsey object in the class of finite bipartite graphs.