We generalize the fact that graphs with small VC-dimension can be
approximated by rectangles, showing that hypergraphs with small VC_k-dimension
(equivalently, omitting a fixed finite (k+1)-partite (k+1)-uniform hypergraph)
can be approximated by k-ary cylinder sets.
In the language of hypergraph regularity, this shows that when H is a
k'-uniform hypergraph with small VC_k-dimension for some k