Infinite Paley graphs

Authors

DOI:

https://doi.org/10.26493/2590-9770.1365.884

Keywords:

Paley graph, random graph, universal graph, quadratic residue, character sum

Abstract

Infinite analogues of the Paley graphs are constructed, based on uncountably many locally finite fields. By using character sum estimates due to Weil, they are shown to be isomorphic to the countable random graph of Erdős, Rényi and Rado.

Downloads

Published

2021-03-10

Issue

Vol. 4 No. 2 (2021)

Section

Groups and Graphs, Designs and Dynamics 2019