On kaleidoscopic pseudo-randomness of finite Euclidean graphs

DOI10.7151/dmgt.1597zbMath1255.05086arXiv0807.2689OpenAlexW2963009082MaRDI QIDQ4647869

Le Anh Vinh

Publication date: 8 November 2012

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0807.2689

zbMATH Keywords

finite Euclidean graphskaleidoscopic pseudo-randomness

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Dot-product sets and simplices over finite rings ⋮ Embedding distance graphs in finite field vector spaces ⋮ The number of occurrences of a fixed spread among \(n\) directions in vector spaces over finite fields ⋮ Parallelograms and the VC-dimension of the distance sets ⋮ Embedding bipartite distance graphs under Hamming metric in finite fields ⋮ Pinned distance sets, \(k\)-simplices, Wolff's exponent in finite fields and sum-product estimates ⋮ An improvement on the number of simplices in \(\mathbb{F}_q^d\) ⋮ Distribution of the determinants of sums of matrices

This page was built for publication: On kaleidoscopic pseudo-randomness of finite Euclidean graphs