Geometric structures in pseudo-random graphs
Combinatorics
2025-04-30 v1
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.
Cite
@article{arxiv.2208.04399,
title = {Geometric structures in pseudo-random graphs},
author = {Thang Pham and Steven Senger and Michael Tait and Vu Thi Huong Thu},
journal= {arXiv preprint arXiv:2208.04399},
year = {2025}
}