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

DOI10.5802/ALCO.82zbMATH Open1428.05326arXiv1808.05319OpenAlexW2992199526WikidataQ126627148 ScholiaQ126627148MaRDI QIDQ2278591FDOQ2278591

Authors: Gabriel Verret, Marston D. E. Conder 

Publication date: 5 December 2019

Published in: Algebraic Combinatorics (Search for Journal in Brave)

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$.

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

Recommendations

• scientific article; zbMATH DE number 4023321
• CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 8p²
• Classifying cubic edge-transitive graphs of order \(8p\)
• Cubic edge-transitive graphs of order 2\(p^{3}\)
• On semisymmetric cubic graphs of order \(20p^2\), \(p\) prime

zbMATH Keywords

arc-transitive graphedge-transitive graphtwin-free graphsemi-symmetric graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Group actions on combinatorial structures (05E18) Representations of finite symmetric groups (20C30)

Cites Work

• The Magma algebra system. I: The user language
• On the structure of generalized quadrangles
• Regular groups of automorphisms of cubic graphs
• Automorphisms of trivalent graphs
• A classification of semisymmetric graphs of order 2pq
• The rank and size of graphs
• A census of 4-valent half-arc-transitive graphs and arc-transitive digraphs of valence two
• A census of semisymmetric cubic graphs on up to 768 vertices
• Title not available (Why is that?)
• Regular line-symmetric graphs
• Cubic vertex-transitive graphs on up to 1280 vertices
• A worthy family of semisymmetric graphs
• A census of small transitive groups and vertex-transitive graphs

Cited In (7)

• Locally bi-2-transitive graphs and cycle-regular graphs, and the answer to a 2001 problem posed by Fouquet and Hahn
• Vertex and edge orbits in nut graphs
• Title not available (Why is that?)
• Elementary abelian covers of the Wreath graph W (3, 2) and the Foster graph F26A
• Constructing flag-transitive incidence structures
• The transitive groups of degree 48 and some applications
• On the number of fixed points of automorphisms of vertex-transitive graphs

Uses Software

• Magma

This page was built for publication: Edge-transitive graphs of small order and the answer to a 1967 question by Folkman

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