Escaping the curse of dimensionality in combinatorics

We discuss some notoriously hard combinatorial problems for large classes of graphs and hypergraphs arising in geometric, algebraic, and practical applications. These structures escape the “curse of dimensionality”: they can be embedded in a bounded-dimensional space, or they have small VCdimension or a short algebraic description. What are the advantages of low dimensionality?