Geometric structures in pseudo-random graphs

Abstract

In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the continuous setting. The results present interactions between discrete geometry, geometric measure theory, and graph theory.

References in corpus (2)

• On the restriction problem for discrete paraboloid in lower dimension
• Embeddings of weighted graphs in Erdős-type settings