Edge-transitive graphs of small order and the answer to a 1967 question by Folkman

Conder MDE; Verret G

dc.contributor.author	Conder MDE
dc.contributor.author	Verret G
dc.date.accessioned	2020-11-12T22:16:41Z
dc.date.available	2020-11-12T22:16:41Z
dc.date.issued	2019-12-4
dc.identifier.citation	Algebraic Combinatorics 2(6):1275-1284 04 Dec 2019
dc.identifier.uri	http://hdl.handle.net/2292/53609
dc.description.abstract	In this paper, we introduce a method for finding all edge-transitive graphs of small order, using faithful representations of transitive permutation groups of small degree, and we explain how we used this method to find all edge-transitive graphs of order up to 47, and all bipartite edge-transitive graphs of order up to 63. We also give an answer to a 1967 question of Folkman about semi-symmetric graphs of large valency; in fact we show that for semi-symmetric graphs of order 2n and valency d, the ratio d/n can be arbitrarily close to 1.
dc.relation.ispartofseries	Algebraic Combinatorics
dc.rights	Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher.
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm
dc.rights.uri	https://creativecommons.org/licenses/by/4.0/
dc.title	Edge-transitive graphs of small order and the answer to a 1967 question by Folkman
dc.type	Journal Article
dc.identifier.doi	10.5802/alco.82
pubs.issue	6
pubs.begin-page	1275
pubs.volume	2
dc.date.updated	2020-10-12T02:08:00Z
dc.rights.holder	Copyright: Algebraic Combinatorics and the authors	en
pubs.author-url	https://alco.centre-mersenne.org/item/ALCO_2019__2_6_1275_0/
pubs.end-page	1275
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en
pubs.subtype	Article
pubs.elements-id	817851
pubs.online-publication-date	2019-12-4