相关论文: Cubic graphs with most automorphisms
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
In this paper, we give the sharp upper bound for the number of vertices with positive curvature in a planar graph with nonnegative combinatorial curvature. Based on this, we show that the automorphism group of a planar---possibly…
In this paper, we introduce notions of partitionability and characteristic sets of homogeneous polynomials and give a complete classification of groups faithfully acting on smooth cubic fivefolds. Specifically, we prove that there exist 20…
We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…
We prove a tight upper bound on the independence polynomial (and total number of independent sets) of cubic graphs of girth at least 5. The bound is achieved by unions of the Heawood graph, the point/line incidence graph of the Fano plane.…
The fine curve graph of a surface is the graph whose vertices are simple closed essential curves in the surface and whose edges connect disjoint curves. In this paper, we prove that the automorphism group of the fine curve graph of a…
We classify all possible automorphism groups of smooth cubic surfaces over an algebraically closed field of arbitrary characteristic. As an intermediate step we also classify automorphism groups of quartic del Pezzo surfaces. We show that…
We settle the automorphism groups of curves appearing in a classification list of smooth plane curves with at least two Galois points. One of them is an ordinary curve whose automorphism group exceeds the Hurwitz bound.
The study of graph C*-algebras has a long history in operator algebras. Surprisingly, their quantum symmetries have never been computed so far. We close this gap by proving that the quantum automorphism group of a finite, directed graph…
Recently, the work on quantum automorphism groups of graphs has seen renewed progress, which we expand in this paper. Quantum symmetry is a richer notion of symmetry than the classical symmetries of a graph. In general, it is non-trivial to…
The problem of finding upper bounds for minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic $2$-groups. We show that for any natural $n\ge 2$ there is an undirected graph…
It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a…
This article provides sharp bounds for the maximum number of edges possible in a simple graph with restricted values of two of the three parameters, namely, maxi- mum matching size, independence number and maximum degree. We also construct…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More…
We show that smooth well formed weighted complete intersections have finite automorphism groups, with several obvious exceptions.
We show that every cubic bridgeless graph with n vertices has at least 3n/4-10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.
In this paper we determine automorphism groups of cyclic algebraic curves defined over finite fields of any characteristic.
In this paper, we classify groups which faithfully act on smooth cubic threefolds. It turns out that there are exactly $6$ maximal ones and we describe them with explicit examples of target cubic threefolds.
Recently Bowden, Hensel and Webb defined the fine curve graph for surfaces, extending the notion of curve graphs for the study of homeomorphism or diffeomorphism groups of surfaces. Later Long, Margalit, Pham, Verberne and Yao proved that…