A Paley-like graph in characteristic two

DOI10.4310/JOC.2016.V7.N2.A8MaRDI QIDQ286759zbMATH OpenFDO

Authors Andrew Thomason

Publication date 25 May 2016

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1509.05198

zbMATH Keywords

Paley graphpseudo-random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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.

Recommendations

• Paley-like graphs over finite fields from vector spaces
• Paley and the Paley Graphs
• On the adjacency properties of paley graphs
• A Characterization of Graphs of Diameter Two
• scientific article; zbMATH DE number 3910442
• On a Paley-type graph on \({\mathbb{Z}}_n\)
• A characterization of some graphs with metric dimension two
• Graphs with metric dimension two - a characterization
• Paley-type graphs of order a product of two distinct primes
• Character sums and Ramsey properties of generalized Paley graphs

Cited in

(1)

• Random hypergraphs in pseudofinite fields

This page was built for publication: A Paley-like graph in characteristic two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286759)