Results 111 to 120 of about 14,423,502 (287)
Transforming Solutions for the Oberwolfach Problem into Solutions for the Spouse‐Loving Variant
Journal of Combinatorial Designs, Volume 34, Issue 8, Page 361-377, August 2026.ABSTRACT The Oberwolfach problem OP ( F ), for a 2‐factor F of K n, asks whether there exists a 2‐factorization of K n (if n is odd) or K n − I (if n is even) where each 2‐factor is isomorphic to F. Here, I denotes any 1‐factor of K n. For even n, the problem OP ( F ) may also be denoted OP − ( F ), and has been nicknamed the spouse‐avoiding variant ...
Maruša Lekše, Mateja Šajna
wiley +1 more source
Automorphisms of the generalized cluster complex
The American Journal of CombinatoricsWe exhibit a dihedral symmetry in the generalized cluster complex defined by Fomin and Reading. Together with diagram symmetries, they generate the automorphism group of the complex.
Matthieu Josuat-Vergès
doaj +1 more source
The probability of generating a finite simple group
, 2013 We study the probability of generating a finite simple group, together with its generalisation PG,socG(d), the conditional probability of generating an almost simple finite group G by d elements, given that these elements generate G/ socG.
Colva M. Roney-Dougal +5 more
core +1 more source
A note on another construction of graphs with $4n+6$ vertices and cyclic automorphism group of order $4n$ [PDF]
, 2017 summary:The problem of finding minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic groups. This problem was considered earlier by other authors. We give a construction of an undirected graph
Peteris Daugulis, Daugulis, Peteris
core +1 more source
Bulletin of the London Mathematical Society, Volume 58, Issue 6, June 2026.Abstract Given r⩾3$r \geqslant 3$, we prove that there exists λ>0$\lambda >0$ depending only on r$r$ so that if G$G$ is a metric graph of rank r$r$ with metric entropy 1, then there exists a proper subgraph H$H$ of G$G$ with metric entropy at least λ$\lambda$. This answers a question of the second two authors together with Rieck. We interpret this as a
Tawfiq Hamed, Tarik Aougab, Matt Clay
wiley +1 more source
The automorphism group of the Andrásfai graph [PDF]
Discrete Mathematics Letters, 2022 Seyed Morteza Mirafzal
doaj +1 more source
The coprime graph of a group [PDF]
International Journal of Group Theory, 2014 The coprime graph $gg$ with a finite group $G$ as follows: Take $G$ as the vertices of $gg$ and join two distinct vertices $u$ and $v$ if $(|u|,|v|)=1$.
Xuan Long Ma +2 more
doaj
Autocommutator subgroups with cyclic outer automorphism group
, 2012 A criterion for the existence of groups admitting autocommutator subgroups with cyclic outer automorphism group is given. Also the classification of those finite groups $G$ such that $K(G)\cong H$ if $H$ is a centerless finite group with cyclic outer ...
Reza R. Moghaddam, Mohammad +2 more
core +1 more source
The fibred density property and the automorphism group of the spectral ball [PDF]
, 2017 We generalize the notion of the density property for complex manifoldsto holomorphic fibrations, and introduce the notion of the fibred density property.We prove that the natural fibration of the spectral ball over the symmetrized polydiscenjoys the ...
Frank Kutzschebauch +3 more
core +1 more source
On the tightness of left‐invariant contact structures
Bulletin of the London Mathematical Society, Volume 58, Issue 6, June 2026.Abstract We prove that all left‐invariant contact structures on three‐dimensional Lie groups are tight. The argument is based on Riemannian methods and establishes a unique factorization property for any Lie group admitting a left‐invariant contact structure, other than SU(2)$\mathrm{SU}(2)$. We then make use of such factorization property to construct
Eugenio Bellini
wiley +1 more source