English
Related papers

Related papers: Abelian 1-factorizations of complete multipartite …

200 papers

Ball, Ortega--Moreno, and Prodromou asked whether, for every odd prime $p$, one can find a $1$-factor of the complete graph $K_{p+1}$ with some arithmetic restrictions related to quadratic residues. This problem is motivated by…

Combinatorics · Mathematics 2026-01-21 Chi Hoi Yip , Semin Yoo

An automorphism of a graph $G=(V,E)$ is a bijective map $\phi$ from $V$ to itself such that $\phi(v_i)\phi(v_j)\in E$ $\Leftrightarrow$ $v_i v_j\in E$ for any two vertices $v_i$ and $v_j$. Denote by $\mathfrak{G}$ the group consisting of…

Combinatorics · Mathematics 2013-12-11 Wen-Xue Du , Yi-Zheng Fan

For any abstract subfactor planar algebra $P$, there exists a finite index extremal subfactor $M_0 \subset M_1$ with $P$ as its standard invariant. In this paper, we classify the automorphism group of a bipartite graph planar algebra, and…

Operator Algebras · Mathematics 2010-03-16 R. D. Burstein

A bipartite graph G is known to be Pfaffian if and only if it does not contain an even subdivision H of $K_{3,3}$ such that $G - VH$ contains a 1-factor. However a general characterisation of Pfaffian graphs in terms of forbidden subgraphs…

Combinatorics · Mathematics 2007-05-23 Charles H. C. Little , Franz Rendl , Ilse Fischer

Let $G=(X,Y;E)$ be a bipartite graph, where $X$ and $Y$ are color classes and $E$ is the set of edges of $G$. Lov\'asz and Plummer \cite{LoPl86} asked whether one can decide in polynomial time that a given bipartite graph $G=(X,Y; E)$…

Combinatorics · Mathematics 2023-06-22 Hongliang Lu , Wei Wang , Juan Yan

For a finite alphabet $\mathcal{A}$ and shift $X\subseteq\mathcal{A}^{\mathbb{Z}}$ whose factor complexity function grows at most linearly, we study the algebraic properties of the automorphism group ${\rm Aut}(X)$. For such systems, we…

Dynamical Systems · Mathematics 2014-11-04 Van Cyr , Bryna Kra

This work is a continuation of Automorphisms of $K$-groups I, P. Flavell, preprint. The main object of study is a finite $K$-group $G$ that admits an elementary abelian group $A$ acting coprimely. For certain group theoretic properties…

Group Theory · Mathematics 2016-09-09 Paul Flavell

The partial automorphisms of a graph $X$ having $N$ vertices are the bijections $\sigma:I\to J$ with $I,J\subset\{1,\ldots,N\}$ which leave invariant the edges. These bijections form a semigroup $\widetilde{G}(X)$, which contains the…

Operator Algebras · Mathematics 2021-12-07 Teo Banica

The automorphism groups of certain factorial complex affine threefolds admitting locally trivial actions of the additive group are determined. As a consequence new counterexamples to a generalized cancellation problem are obtained.

Algebraic Geometry · Mathematics 2007-06-29 David Finston , Stefan Maubach

Let k be an algebraically closed field of characteristic zero, F its algebraically closed extension, and G be the group of k-automorphisms of F endowed with a natural topology. One of the purposes of this paper is to show that any…

Representation Theory · Mathematics 2009-04-07 M. Rovinsky

Let $1 \to N \to G \to H \to 1$ be an abelian extension. The purpose of this paper is to study the problem of extending automorphisms of $N$ and lifting automorphisms of $H$ to certain automorphisms of $G$.

Group Theory · Mathematics 2011-01-21 I. B. S. Passi , Mahender Singh , Manoj K. Yadav

Let $n$ and $k$ be integers with $n> k\geq1$ and $[n] = \{1, 2, ... , n\} $. The $bipartite \ Kneser \ graph$ $H(n, k)$ is the graph with the all $k$-element and all ($n-k$)-element subsets of $[n] $ as vertices, and there is an edge…

Group Theory · Mathematics 2018-04-13 S. Morteza Mirafzal , Ali Zafari

We investigate 1-factorisations in which the 2-regular graphs that occur as the union of a pair of 1-factors appear an equal number of times across the unions of all pairs of 1-factors in the 1-factorisation. We call such 1-factorisations…

Combinatorics · Mathematics 2024-12-02 Jeremy Mitchell

We survey recent results on multiple transitivity of automorphism groups of affine algebraic varieties. We consider the property of infinite transitivity of the special automorphism group, which is equivalent to flexibility of the…

Algebraic Geometry · Mathematics 2023-04-04 Ivan Arzhantsev

For all Frobenius groups and a large class of finite multiply transitive permutation groups, we show that the corresponding group-subgroup subfactors are completely characterized by their principal graphs. The class includes all the sharply…

Operator Algebras · Mathematics 2023-04-18 Masaki Izumi

We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…

Combinatorics · Mathematics 2025-09-24 Martin Grohe , Pascal Schweitzer , Daniel Wiebking

In this paper, we find the crossing number of the complete multipartite graphs $K_{1,1,1,1,n}$, $K_{1,2,2,n}$, $K_{1,1,1,2,n}$ and $K_{1,4,n}$.

Combinatorics · Mathematics 2013-10-17 Pak Tung Ho

A graph $X$ is $k$-spanning cyclable if for any subset $S$ of $k$ distinct vertices there is a 2-factor of $X$ consisting of $k$ cycles such that each vertex in $S$ belongs to a distinct cycle. In this paper we examine the $k$-spanning…

Combinatorics · Mathematics 2024-02-21 Brian Alspach , Aditya Joshi

The following problem is considered: if $H$ is a semiregular abelian subgroup of a transitive permutation group $G$ acting on a finite set $X$, find conditions for (non) existence of $G$-invariant partitions of $X$. Conditions presented in…

Group Theory · Mathematics 2014-04-04 Istvan Kovacs , Aleksander Malnic , Dragan Marusic , Stefko Miklavic

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…

Discrete Mathematics · Computer Science 2015-12-31 Vivek S. Nittoor