activity
20072025
most citedThe diameter of random Cayley digraphs of given degree

2 citations · 2 across the 5 of their papers we have counts for

collaborators

7 papers

math.CO2025

Edge-transitive cubic graphs: Cataloguing and Enumeration

Marston Conder, Primož Potočnik

This paper deals with finite cubic (-regular) graphs whose automorphism group acts transitively on the edges of the graph. Such graphs split into two broad classes, namely arc-t…

math.CO2018

Infinite arc-transitive and highly-arc-transitive digraphs

Rögnvaldur G. Möller, Primož Potočnik, Norbert Seifter

A detailed description of the structure of two-ended arc-transitive digraphs is given. It is also shown that several sets of conditions, involving such concepts as Property Z, loca…

math.CO2018

Sharply -arc-transitive-digraphs: finite and infinite examples

Rögnvaldur G. Möller, Primož Potočnik, Norbert Seifter

A general method for constructing sharply -arc-transitive digraphs, i.e. digraphs that are -arc-transitive but not -arc-transitive, is presented. Using our method it i…

math.CO2018

Lifting a prescribed group of automorphisms of graphs

Pablo Spiga, Primož Potočnik

In this paper we are interested in lifting a prescribed group of automorphisms of a finite graph via regular covering projections. Here we describe with an example the problems we…

math.GR2015

Groups of order at most 6 000 generated by two elements, one of which is an involution, and related structures

Primož Potočnik, Pablo Spiga, Gabriel Verret

A (2,*)-group is a group that can be generated by two elements, one of which is an involution. We describe the method we have used to produce a census of all (2,*)-groups of order…

math.CO2012

Locally arc-transitive graphs of valence with trivial edge kernel

Primož Potočnik

In this paper we consider connected locally -arc-transitive graphs with vertices of valence 3 and 4, such that the kernel of the action of an edge-stabiliser on t…