On kaleidoscopic pseudo-randomness of finite Euclidean graphs

2008/07/17 by Le Anh Vinh, Vinh, Le Anh · 1 citation
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.0807.2689

arxiv created 2008/08/03 · arxiv updated 2009/12/01

Abstract

In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods. Roughly speaking, we show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every possible finite configurations.

Cited by

• Distribution of simplices in the discrete and continuous settings

Related

• Distance graphs in vector spaces over finite fields, coloring and pseudo-randomness
• Pseudo-random graphs
• Interpreting Random Hypergraphs in Pseudofinite Fields
• The random graph
• A note on the relation between two properties of random graphs