Using a slightly stronger version of Theorem REF  for bipartite graphs \(G=(A,B,E)\)  with \(|A|\)  and \(|B|\)  of possibly different sizes and with dual shatter function of degree at most d, the observation that semi-algebraic bipartite graphs of bounded description complexity also have bounded VC-dimension (a consequence of the Milnor-Thom theorem), and a standard amplification trick via the so-called cutting lemma of Chazelle [1]}, the authors deduced the following general result.
