Semiregular elements in cubic vertex-transitive graphs and the restricted Burnside problem
From MaRDI portal
Publication:2877361
DOI10.1017/S0305004114000188zbMath1297.05113arXiv1211.7335MaRDI QIDQ2877361
Publication date: 22 August 2014
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.7335
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Semiregular automorphisms in vertex-transitive graphs with a solvable group of automorphisms, Three local actions in 6‐valent arc‐transitive graphs, Cubic vertex-transitive graphs admitting automorphisms of large order, On orders of automorphisms of vertex-transitive graphs, Semiregular automorphisms of cubic vertex-transitive graphs and the abelian normal quotient method, Semiregular automorphisms in vertex-transitive graphs of order \(3p^2\), Cubic vertex-transitive graphs of girth six, Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices, Classification of cubic vertex-transitive tricirculants
Cites Work
- Unnamed Item
- Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph
- All vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism
- Semiregular automorphisms of vertex-transitive graphs of certain valencies
- Distance-transitive graphs admit semiregular automorphisms
- On vertex symmetric digraphs
- Maps and half-transitive graphs of valency 4
- The Magma algebra system. I: The user language
- Semiregular automorphisms of vertex-transitive cubic graphs
- Transitive Permutation Groups Without Semiregular Subgroups
- On the p -Length of p -Soluble Groups and Reduction Theorems for Burnside's Problem
- Groups with exponent six