Infinite Paley graphs
DOI10.26493/2590-9770.1365.884zbMath1469.05119arXiv1912.02709OpenAlexW3125223010MaRDI QIDQ4958983
Publication date: 15 September 2021
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.02709
Random graphs (graph-theoretic aspects) (05C80) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Finite fields (field-theoretic aspects) (12E20) Estimates on character sums (11L40) Model theory of finite structures (03C13) Model theory of denumerable and separable structures (03C15) Infinite automorphism groups (20B27) Infinite graphs (05C63) Group actions on combinatorial structures (05E18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On generalised Paley graphs and their automorphism groups
- Graphs which contain all small graphs
- Equations over finite fields. An elementary approach
- Several generalizations of Weil sums
- A Theorem on Permutations in a Finite Field
- On Character Sums and Primitive Roots†
- Paley and the Paley Graphs
- The group of the countable universal graph
- Paley graphs satisfy all first-order adjacency axioms
- Model Theory
- Universal graphs and universal functions
- A Constructive Solution to a Tournament Problem
- The random graph
- Asymmetric graphs
- Numbers of solutions of equations in finite fields
This page was built for publication: Infinite Paley graphs