### Abstract

We investigate the set of those integers n for which directly indecomposable groups of order n exist. For even n such groups are easily constructed. In contrast, we show that the density of the set of odd numbers with this property is zero. For each n we define a graph whose connected components describe uniform direct decompositions of all groups of order n. We prove that for almost all odd numbers (i.e., with the exception of a set of density zero) this graph has a single 'big' connected component and all other vertices are isolated. We also give an asymptotic formula for the number of isolated vertices of the graph, i.e., for the number of prime divisors q of n such that every group of order n has a cyclic direct factor of order q.

Original language | English |
---|---|

Pages (from-to) | 165-179 |

Number of pages | 15 |

Journal | Discrete Mathematics |

Volume | 200 |

Issue number | 1-3 |

DOIs | |

Publication status | Published - Apr 6 1999 |

### Fingerprint

### Keywords

- Density
- Indecomposable group
- Uniform factorization

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

### Cite this

*Discrete Mathematics*,

*200*(1-3), 165-179. https://doi.org/10.1016/S0012-365X(98)00325-2