5 citations · 5 across the 2 of their papers we have counts for
6 papers · 1 filter
On graph-restrictive permutation groups
Primoz Potocnik, Pablo Spiga, Gabriel Verret
Let be a connected -vertex-transitive graph, let be a vertex of and let be the permutation group induced by the action of the vertex-stabiliser …
Tetravalent arc-transitive graphs with unbounded vertex-stabilisers
Primoz Potocnik, Pablo Spiga, Gabriel Verret
It has long been known that there exist finite connected tetravalent arc-transitive graphs with arbitrarily large vertex-stabilisers. However, beside a well known family of excepti…
Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs
Primoz Potocnik, Pablo Spiga, Gabriel Verret
The main result of this paper is that, if is a connected 4-valent -arc-transitive graph and is a vertex of , then either is one of a well understood infinite fami…
A note on 2-subset-regular self-complementary 3-uniform hypergraphs
Martin Knor, Primoz Potocnik
We show that a 2-subset-regular self-complementary 3-uniform hypergraph with vertices exists if and only if and is congruent to 2 modulo 4.
Counting One-Vertex Maps
Alen Orbanic, Marko Petkovsek, Tomaz Pisanski +1
The number of distinct maps (pre-maps) with a single vertex and valence is computed for any value of . The types of maps (pre-maps) that we consider depend on whether the un…
Semisymmetric elementary abelian covers of the Möbius-Kantor graph
A. Malnic, D. Marusic, S. Miklavic +1
Let $\p_N \colon \tX \to X$ be a regular covering projection of connected graphs with the group of covering transformations isomorphic to . If is an elementary abelian -g…