Geometric structures in pseudo-random graphs

Authors

• Steven Senger, Missouri State UniversityFollow
• Thang Pham, Vietnam National University, Hanoi
• Michael Tait, Villanova University
• Vu Thi Huong Thu, Villanova University

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.

Department(s)

Mathematics

Document Type

Article

DOI

10.4153/S0008414X24000245

Keywords

finite fields, geometric structures, Pseudo-random graphs

Publication Date

6-1-2025

Recommended Citation

Senger, Steven; Pham, Thang; Tait, Michael; and Thu, Vu Thi Huong, "Geometric structures in pseudo-random graphs" (2025). Faculty Scholarship. 141.
https://bearworks.missouristate.edu/articles00/141

Journal Title

Canadian Journal of Mathematics