English
Related papers

Related papers: Vertex-transitive covers of semi-equivelar toroida…

200 papers

The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism, that is, a nontrivial automorphism whose cycles all have the same length. In this paper we investigate the existence of semiregular…

Combinatorics · Mathematics 2013-06-11 Michael Giudici , Primoz Potocnik , Gabriel Verret

Among all equivelar vertex-transitive maps on a given closed surface S, the automorphism groups of maps with Schl\"afli types {3, 7} and {7, 3} allow the highest possible order. We describe a procedure to transform all such maps into 1- or…

Combinatorics · Mathematics 2011-10-28 Daniel Pellicer

The automorphism group of a map acts naturally on its flags (triples of incident vertices, edges, and faces). An Archimedean map on the torus is called almost regular if it has as few flag orbits as possible for its type; for example, a map…

Group Theory · Mathematics 2018-10-03 Kostiantyn Drach , Yurii Haidamaka , Mark Mixer , Maksym Skoryk

One version of the polycirculant conjecture states that every vertex-transitive graph has a semiregular automorphism. We give a proof of the conjecture in the arc-transitive case for graphs of valency 8, which was the smallest open case.

Combinatorics · Mathematics 2013-03-20 Gabriel Verret

A core of a graph X is a vertex minimal subgraph to which X admits a homomorphism. Hahn and Tardif have shown that for vertex transitive graphs, the size of the core must divide the size of the graph. This motivates the following question:…

Combinatorics · Mathematics 2013-02-20 David Roberson

A graph is vertex-transitive if its automorphism group acts transitively on vertices of the graph. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper,…

Group Theory · Mathematics 2022-03-10 Majid Arezoomand , Mohsen Ghasemi , Mohammad A. Iranmanesh

A tiling (edge-to-edge) of the plane is a family of tiles that cover the plane without gaps or overlaps. Vertex figure of a vertex in a tiling to be the union of all edges incident to that vertex. A tiling is $k$-vertex-homogeneous if any…

Combinatorics · Mathematics 2022-01-21 Marbarisha M. Kharkongor , Dipendu Maity

If the cyclic sequences of {face types} {at} all vertices in a map are the same, then the map is said to be a semi-equivelar map. In particular, a semi-equivelar map is equivelar if the faces are the same type. Homological quantum codes…

Combinatorics · Mathematics 2020-07-06 Debashis Bhowmik , Dipendu Maity , Bhanu Pratap Yadav , Ashish Kumar Upadhyay

We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant…

Combinatorics · Mathematics 2019-01-03 Michael Giudici , Gabriel Verret

Quasi-homogeneous surfaces, or Gizatullin surfaces, are normal affine surfaces such that there exists an open orbit of the automorphism group with a finite complement. If the action of the automorphism group is transitive, the surface is…

Algebraic Geometry · Mathematics 2014-04-17 Sergei Kovalenko

We characterise connected cubic graphs admitting a vertex- transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a…

Combinatorics · Mathematics 2014-01-14 Joy Morris , Pablo Spiga , Gabriel Verret

A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…

Combinatorics · Mathematics 2022-08-15 Primož Potočnik , Micael Toledo

A connected graph whose automorphism group acts transitively on the edges and vertices, but not on the set of ordered pairs of adjacent vertices of the graph is called half-arc-transitive. It is well known that the valence of a…

Combinatorics · Mathematics 2015-03-16 Primož Potočnik , Rok Požar

Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms $\rho$ and $\sigma$, where $\rho$ is $(m,n)$-semiregular for some integers $m \geq 1$, $n \geq 2$, and where…

Combinatorics · Mathematics 2007-05-23 Dragan Marusic , Primoz Sparl

A graph or hypergraph is said to be vertex-transitive if its automorphism group acts transitively upon its vertices. A classic theorem of Mader asserts that every connected vertex-transitive graph is maximally edge-connected. We generalise…

Combinatorics · Mathematics 2023-10-02 Andrea C. Burgess , Robert D. Luther , David A. Pike

A face-transitive surface is a triangulated 2-dimensional manifold whose automorphism group acts transitively on its set of triangles. In this paper, we investigate this class of highly symmetric surface triangulations. We identify seven…

Combinatorics · Mathematics 2025-05-02 Reymond Akpanya , Jonathan Spreer

We present enumerations of a class of toroidal graphs which give rise to semi-equivelar maps. There are eleven different types of semi-equivelar maps on the torus. These are of the types $\{3^{6}\}$, $\{4^{4}\}$, $\{6^{3}\}$, $\{3^{3},…

Combinatorics · Mathematics 2017-05-05 Dipendu Maity , Ashish Kumar Upadhyay

Recently the classification of all possible faithful transitive permutation representations of the group of symmetries of a regular toroidal map was accomplished. In this paper we complete this investigation on a surface of genus 1…

Group Theory · Mathematics 2020-05-19 Maria Elisa Fernandes , Claudio Alexandre Piedade

We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that…

Logic · Mathematics 2019-08-16 John Clemens , Samuel Coskey , Stephanie Potter

Semi-transitive graphs, defined in \cite{hps98} as examples where ``uniform percolation" holds whenever $p>p_c$, are a large class of graphs more general than quasi-transitive graphs. Let $G$ be a semi-transitive graph with one end which…

Combinatorics · Mathematics 2023-07-21 Zhongyang Li