Related papers: Non-solvable $2$-arc-transitive covers of Petersen…

In this note, we consider the problem of generating $k$-factorable graphic sequences with connected (resp. no connected) $k$-factors.

In this note we construct two infinite snark families which have high oddness and low circumference compared to the number of vertices. Using this construction, we also give a counterexample to a suggested strengthening of Fulkerson's…

A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…

We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups ${\mathbb Z}_n$, symmetric groups $S_n$ and quantum symmetric groups…

There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.

Covering all edges of a graph by a small number of vertices, this is the NP-complete Vertex Cover problem. It is among the most fundamental graph-algorithmic problems. Following a recent trend in studying temporal graphs (a sequence of…

A transitive graph is 2-dimensional if it can be represented as the intersection of two linear orders. Such representations make answering of reachability queries trivial, and allow many problems that are NP-hard on arbitrary graphs to be…

We review the nearly complete classification project for finite distance-transitive graphs and compile a list of all known graphs. Interestingly, we find that those graphs with diameter larger than 4, apart from a small finite number of…

For any right-angled Artin group, we show that its outer automorphism group contains either a finite-index nilpotent subgroup or a nonabelian free subgroup. This is a weak Tits alternative theorem. We find a criterion on the defining graph…

A graph is said to be {\em vertex-transitive non-Cayley} if its full automorphism group acts transitively on its vertices and contains no subgroups acting regularly on its vertices. In this paper, a complete classification of cubic…

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

We study non-commutative operator graphs generated by resolutions of identity covariant with respect to unitary representations of a compact group. Our main goal is searching for orthogonal projections which are anticliques…

The relative fixity of a permutation group is the maximum proportion of the points fixed by a non-trivial element of the group and the relative fixity of a graph is the relative fixity of its automorphism group, viewed as a permutation…

We construct an additive category where objects are embedded graphs in the 3-sphere and morphisms are geometric correspondences given by 3-manifolds realized in different ways as branched covers of the 3-sphere, up to branched cover…

In this paper we analyze the structure of some subalgebras of quantized enveloping algebras corresponding to unipotent and solvable subgroups of a simple Lie group G. These algebras have the non--commutative structure of iterated algebras…

We introduce a new class of graphs which we call P-transitive graphs, lying between transitive and 3-transitive graphs. First we show that the analogue of de Jongh-Sambin Theorem is false for wellfounded P-transitive graphs; then we show…

We exploit a new theory of duality transformations to construct dual representations of models incompatible with traditional duality transformations. Hence we obtain a solution to the long-standing problem of non-Abelian dualities that…

In this paper, we study edge-transitive surfaces, i.e. triangulated 2-dimensional manifolds whose automorphism groups act transitively on the edges of these triangulated surfaces. We show that there exist four types of edge-transitive…

The eternal vertex cover problem is a dynamic variant of the classical vertex cover problem. It is NP-hard to compute the eternal vertex cover number of graphs and known algorithmic results for the problem are very few. This paper presents…

A vertex triple $(u,v,w)$ of a graph is called a $2$-geodesic if $v$ is adjacent to both $u$ and $w$ and $u$ is not adjacent to $w$. A graph is said to be $2$-geodesic transitive if its automorphism group is transitive on the set of…