2015/09/17 by Andrew Thomason, Thomason, Andrew
Mathematics · #05C25 #05C45 #05C99 #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #Limits and Structures in Graph Theory #math.CO #msc:05C25 #msc:05C45 #msc:05C99
paper · pdf · doi:10.48550/arxiv.1509.05198
arxiv created 2015/09/17 · openalex publication_date 2015/09/17 · arxiv updated 2015/09/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Paley graph is a well-known self-complementary pseudo-random graph, defined over a finite field of odd order. We describe an attempt at an analogous construction using fields of even order. Some properties of the graph are noted, such as the existence of a Hamiltonian decomposition.