A Paley-like graph in characteristic two
| dc.creator | Thomason, Andrew Gordon | |
| dc.date.accessioned | 2015-09-18 | |
| dc.date.accessioned | 2018-11-24T23:27:32Z | |
| dc.date.available | 2017-09-18T09:21:40Z | |
| dc.date.available | 2018-11-24T23:27:32Z | |
| dc.date.issued | 2016 | |
| dc.identifier | https://www.repository.cam.ac.uk/handle/1810/267249 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/123456789/4000 | |
| dc.description.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. | |
| dc.language | en | |
| dc.publisher | Journal of Combinatorics | |
| dc.subject | math.CO | |
| dc.subject | math.CO | |
| dc.subject | 05C99, 05C25, 05C45 | |
| dc.title | A Paley-like graph in characteristic two | |
| dc.type | Article |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| 1509.05198.pdf | 134.0Kb | application/pdf | View/ |