English
Related papers

Related papers: Perfect 1-factorisations of $K_{16}$

200 papers

Zaslavsky proved in 2012 that, up to switching isomorphism, there are six different signed Petersen graphs and that they could be told apart by their chromatic polynomials, by showing that the latter give distinct results when evaluated at…

Combinatorics · Mathematics 2019-04-10 Matthias Beck , Erika Meza , Bryan Nevarez , Alana Shine , Michael Young

A graph $G$ is $1$-extendible if every edge belongs to at least one $1$-factor of $G$. Let $G$ be a graph with a $1$-factor $F$. Then an even $F$-orientation of $G$ is an orientation in which each $F$-alternating cycle has exactly an even…

Combinatorics · Mathematics 2024-03-20 M. Abreu , D. Labbate , F. Romaniello , J. Sheehan

Let $\Gamma(G)$ be the prime graph associated with a finite group $G$ and $D(G)$ be the degree pattern of $G$. A finite group $G$ is said to be $k$-fold OD-characterizable if there exist exactly $k$ non-isomorphic groups $H$ such that…

Group Theory · Mathematics 2017-05-26 Ali Reza Moghaddamfar

This paper investigates the enumeration of Cayley digraphs, focusing on counting Cayley digraphs on dihedral groups up to CI-isomorphism. By leveraging the Cauchy-Frobenius Lemma and properties of automorphisms, we derive an explicit…

Combinatorics · Mathematics 2025-07-30 Zai Ping Lu , Jia Yin Xie , Jin-Hua Xie

We give a complete classification of smooth, complex projective Fano 4-folds of Picard number 3 having a prime divisor of Picard number 1. They form 28 distinct families, and we compute the main numerical invariants, study the base locus of…

Algebraic Geometry · Mathematics 2023-03-24 Saverio Andrea Secci

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…

Differential Geometry · Mathematics 2018-11-26 Bobo Hua , Yanhui Su

We present an approach to enumerate graphs whose automorphism group has exactly two orbits. Our method exploits the observation that we can enumerate all graphs whose automorphism group contains a given this permutation group. We obtain the…

Discrete Mathematics · Computer Science 2026-04-02 David Seka , Stefan Szeider

An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and…

Combinatorics · Mathematics 2021-08-02 Fu-Gang Yin , Yan-Quan Feng , Jin-Xin Zhou , A-Hui Jia

We study the automorphisms of a function field of genus $g\geq 2$ over an algebraically closed field of characteristic $p>0$. More precisely, we show that the order of a nilpotent subgroup $G$ of its automorphism group is bounded by $16…

Algebraic Geometry · Mathematics 2019-12-18 Nurdagül Anbar , Burçin Güneş

In this paper we present a method for constructing directed strongly regular graphs with assumed action of an automorphism group. The application of this method leads to first examples of directed strongly regular graphs with parameters…

Combinatorics · Mathematics 2024-12-23 Marija Maksimović , Sanja Rukavina

We give two characterisations of when a map-germ admits a 1-parameter stable unfolding, one related to the $\mathscr K_e$-codimension and another related to the normal form of a versal unfolding. We then prove that there are infinitely many…

Algebraic Geometry · Mathematics 2024-10-15 Ignacio Breva Ribes , Raúl Oset Sinha

In this paper, we have computed the automorphism groups of all groups of order $p^{2}q^{2}$, where $p$ and $q$ are distinct primes.

Group Theory · Mathematics 2022-10-20 Ratan Lal , Vipul Kakkar

Let $F_1$ and $F_2$ be two disjoint graphs. The union $F_1\cup F_2$ is a graph with vertex set $V(F_1)\cup V(F_2)$ and edge set $E(F_1)\cup E(F_2)$, and the join $F_1+F_2$ is a graph with vertex set $V(F_1)\cup V(F_2)$ and edge set…

Combinatorics · Mathematics 2022-08-01 Wei Dong , Baogang Xu , Yian Xu

In this paper we investigate families of connected graphs which do not contain an odd cycle in their complement. Specifically, we consider graphs formed by two complete graphs connected in a particular way. We determine which of these…

Group Theory · Mathematics 2020-08-27 Jacob Laubacher , Mark Medwid

Let $K$ be an arbitrary field of characteristic zero, $P_n:= K[ x_1, ..., x_n]$ be a polynomial algebra, and $P_{n, x_1}:= K[x_1^{-1}, x_1, ..., x_n]$, for $n\geq 2$. Let $\s' \in {\rm Aut}_K(P_n)$ be given by $$ x_1\mapsto x_1-1, \quad…

Rings and Algebras · Mathematics 2007-05-23 V V Bavula , T H Lenagan

The author determines the structure of automorphism groups of smooth plane curves of degree at least four. Furthermore, he gives some upper bounds for the order of automorphism groups of smooth plane curves and classifies the cases with…

Algebraic Geometry · Mathematics 2014-06-10 Takeshi Harui

We study the problem of counting the number of homomorphisms from an input graph $G$ to a fixed (quantum) graph $\bar{H}$ in any finite field of prime order $\mathbb{Z}_p$. The subproblem with graph $H$ was introduced by Faben and Jerrum…

Computational Complexity · Computer Science 2022-08-19 J. A. Gregor Lagodzinski , Andreas Göbel , Katrin Casel , Tobias Friedrich

We study several extensions of the notion of perfect graphs to $k$-uniform hypergraphs.

Combinatorics · Mathematics 2022-10-04 Maria Chudnovsky , Gil Kalai

For each field $k$ of characteristic zero, we classify which groups act by automorphisms on a quartic del Pezzo surface over $k$. We also determine which groups act on $k$-rational, stably $k$-rational, or $k$-unirational quartic del Pezzo…

Algebraic Geometry · Mathematics 2023-08-16 Jonathan M. Smith

In this paper, we investigate the structure of the automorphism groups of pure braid groups. We prove that, for $n>3$, $\Aut(P_n)$ is generated by the subgroup $\Aut_c(P_n)$ of central automorphisms of $P_n$, the subgroup $\Aut(B_n)$ of…

Group Theory · Mathematics 2021-07-19 Valeriy G. Bardakov , Mikhail V. Neshchadim , Mahender Singh