Geometric structures in pseudo-random graphs Journal Articles

abstract

• 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.

authors

• Pham, Thang
• Senger, Steven
• Tait, Michael
• Thu, Vu Thi Huong

publication date

• January 1, 2024

has subject area

• 0101 Pure Mathematics (FoR)
• General Mathematics (Science Metrix)

published in

• Canadian Journal of Mathematics  Journal

keywords

• FINITE
• Mathematics
• Physical Sciences
• Pseudo-random graphs
• RESTRICTION
• SETS
• SUBSETS
• Science & Technology
• VECTOR-SPACES
• finite fields
• geometric structures

Digital Object Identifier (DOI)

• 10.4153/s0008414x24000245

start page

• 1

end page

• 31