A Paley-like graph in characteristic two
Combinatorics
2015-09-18 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1509.05198,
title = {A Paley-like graph in characteristic two},
author = {Andrew Thomason},
journal= {arXiv preprint arXiv:1509.05198},
year = {2015}
}