English
Related papers

Related papers: Closure Properties in the Class of Multiple Contex…

200 papers

We investigate the ability of a free pro-$\CC$ group of infinite rank to abstractly solve abstract embedding problems, and conclude that for some varieties $\CC$, the profinite completion of any order, of a free pro-$\CC$ group of infinite…

Group Theory · Mathematics 2023-01-31 Tamar Bar-On

In this paper we characterize groups according to the number of end vertices in the associated coprime graphs. An upper bound on the order of the group that depends on the number of end vertices is obtained. We also prove that $2-$groups…

Group Theory · Mathematics 2018-03-08 Tariq A. Alraqad , Muhammad S. Saeed. , Etaf S. Alshawarbeh

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

A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.

Combinatorics · Mathematics 2007-10-23 Andy Frohmader

The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…

Group Theory · Mathematics 2016-12-15 Adeleh Abdolghafourian , Mohammad A. Iranmanesh , Alice C. Niemeyer

We report on recent progress concerning the relationship that exists between the algebraic structure of a finite group and certain features of its class-size prime graph.

Group Theory · Mathematics 2024-10-02 Víctor Sotomayor

In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…

Group Theory · Mathematics 2013-01-21 Mathieu Carette

In this paper we study prime graphs of finite groups. The prime graph of a finite group $G$, also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing $|G|$} and an edge $p$-$q$ if and only if there exists an…

Group Theory · Mathematics 2022-01-04 Chris Florez , Jonathan Higgins , Kyle Huang , Thomas Michael Keller , Dawei Shen , Yong Yang

We prove that the generalised word problem of a finitely generated subgroup of a finitely generated virtually free group is context-free, that a hyperbolic group must be virtually free if it has a torsion-free quasiconvex subgroup of…

Group Theory · Mathematics 2015-11-04 Derek F. Holt , Sarah Rees

We show that the class of profinite duality groups is closed under group extensions provided that the kernel satisfies some finiteness condition. This extends earlier results of Pletch and of Wingberg.

Group Theory · Mathematics 2008-09-26 Alexander Schmidt , Kay Wingberg

In this note we show that groups with definable generics in a separably closed valued of finite imperfection degree can be embedded into groups definable in their algebraic closure.

Logic · Mathematics 2017-11-07 Silvain Rideau

For a finite group $G$, let $\Delta(G)$ denote the character graph built on the set of degrees of the irreducible complex characters of $G$. In this paper, we determine the structure of all finite groups $G$ with $K_4$-free character graph…

Group Theory · Mathematics 2019-09-04 Mahdi Ebrahimi

The co-word problem of a group G generated by a set X is defined as the set of words in X which do not represent 1 in G. We introduce a new method to decide if a permutation group has context-free co-word problem. We use this method to…

Group Theory · Mathematics 2007-05-23 Joerg Lehnert , Pascal Schweitzer

We show that if the Sch\"{u}tzenberger graph of every positive word, that contains an $R$-word only once as it's subword, is finite over an Adain presentation $\langle X|u=v\rangle$, then the Sch\"{u}tzenberger graph of every positive word…

Group Theory · Mathematics 2020-01-14 Muhammad Inam

We define a class of finite groups based on the properties of the closed twins of their power graphs and study the structure of those groups. As a byproduct, we obtain results about finite groups admitting a partition by cyclic subgroups.

Group Theory · Mathematics 2024-12-23 Daniela Bubboloni , Nicolas Pinzauti

Some completely positive maps on reduced amalgamated free products of C*-algebras are constructed; these allow a proof that the class of exact unital C*-algebras is closed under taking reduced amalgamated free products. Consequently, the…

Operator Algebras · Mathematics 2007-05-23 Ken Dykema

Let $G$ be a hyperbolic group that splits as a graph of free groups with cyclic edge groups. We prove that, unless $G$ is isomorphic to a free product of free and surface groups, every finite abelian group $M$ appears as a direct summand in…

Group Theory · Mathematics 2025-05-28 Dario Ascari , Jonathan Fruchter

Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…

Rings and Algebras · Mathematics 2015-11-20 Gabor Elek

The well-known characterization of two-ended groups says that every two-ended group can be split over finite subgroups which means it is isomorphic to either by a free product with amalgamation $A\ast_C B$ or an HNN-extension $\ast_{\phi}…

Combinatorics · Mathematics 2018-12-13 Babak Miraftab , Tim Rühmann

A $k$-ended tree is a tree with at most $k$ leaves. In this note, we give a simple proof for the following theorem. Let $G$ be a connected graph and $k$ be an integer ($k\geq 2$). Let $S$ be a vertex subset of $G$ such that $\alpha_{G}(S)…

Combinatorics · Mathematics 2018-10-29 Pham Hoang Ha
‹ Prev 1 3 4 5 6 7 10 Next ›