Groups as the union of proper subgroups.
The prime graph of a finite group is defined as follows: the set of vertices is , the set of primes dividing the order of , and two vertices , are joined by an edge (we write ) if and only if there exists an element in of order . We study the groups such that the prime graph is a tree, proving that, in this case, .
In this paper we classify finite groups with disconnected intersection graphs of subgroups. This solves a problem posed by Csákány and Pollák.
We study the minimal number of elements of maximal order occurring in a zero-sumfree sequence over a finite Abelian p-group. For this purpose, and in the general context of finite Abelian groups, we introduce a new number, for which lower and upper bounds are proved in the case of finite Abelian p-groups. Among other consequences, our method implies that, if we denote by exp(G) the exponent of the finite Abelian p-group G considered, every zero-sumfree sequence S with maximal possible length over...