No CrossRef data available.
Article contents
Geometric structures in pseudo-random graphs
Published online by Cambridge University Press: 15 March 2024
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.
MSC classification
- Type
- Article
- Information
- Copyright
- © The Author(s), 2024. Published by Cambridge University Press on behalf of Canadian Mathematical Society
Footnotes
T. Pham was supported by the Vietnam National Foundation for Science and Technology Development (NAFOSTED) under grant number 101.99–2021.09. M. Tait was partially supported by National Science Foundation Grant DMS-2011553 and a Villanova University Summer Grant.