Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces
From MaRDI portal
Publication:1010710
zbMath1206.05054arXiv0711.3508MaRDI QIDQ1010710
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0711.3508
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Generalized Ramsey theory (05C55) Erd?s problems and related topics of discrete geometry (52C10)
Related Items
The number of occurrences of a fixed spread among \(n\) directions in vector spaces over finite fields, On the additive energy of the distance set in finite fields, The generalized \(k\)-resultant modulus set problem in finite fields, The analog of the Erdös distance problem in finite fields, On distance sets and product sets in vector spaces over finite rings, On a Furstenberg-Katznelson-Weiss type theorem over finite fields, Distance sets of two subsets of vector spaces over finite fields, On the Sums of Any $k$ Points in Finite Fields, On the generalized Erdős-Falconer distance problems over finite fields, Commutative association schemes, On character sums with distances on the upper half plane over a finite field