Infinite Paley graphs
Combinatorics
2019-12-06 v1
Abstract
Infinite analogues of the Paley graphs are constructed, based on uncountably many infinite but locally finite fields. Weil's estimate for character sums shows that they are all isomorphic to the random or universal graph of Erd\H os, R\'enyi and Rado. Automorphism groups and connections with model theory are considered.
Keywords
Cite
@article{arxiv.1912.02709,
title = {Infinite Paley graphs},
author = {Gareth A. Jones},
journal= {arXiv preprint arXiv:1912.02709},
year = {2019}
}
Comments
10 pages/