Summary
Our main objective was to study hard combinatorial problems for large classes of graphs and hypergraphs arising in geometric,algebraic, and practical applications. In particular, for structures escaping the“curse of dimensionality”: if they can be embedded in a...
More information & hyperlinks
Web resources: | https://users.renyi.hu/ |