Geometric structures in pseudo-random graphs
From MaRDI portal
Publication:6407331
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.
This page was built for publication: Geometric structures in pseudo-random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6407331)
