2021
DOI: 10.1017/s0004972721000149
|View full text |Cite
|
Sign up to set email alerts
|

Connected Components in the Invariably Generating Graph of a Finite Group

Abstract: We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 27 publications
0
1
0
Order By: Relevance
“…One of the first motivations for investigating finite groups having normal covering number 2 goes back to a problem in Galois theory (for more details see [8, Section 1]) and is linked to the study of intersective polynomials, that is, integer polynomials having a root modulo p, for every prime number p (see [18] and [74]). Recently, simple groups having normal covering number 2 have been used to construct sparsely connected invariably generating graphs [41]. There is also a unexpected connection between the theory of transitive permutation groups G in which every derangement is a p-element for some prime p and the normal 2-coverings of G. Indeed, as observed in [20], G has such property if and only if G admits a normal 2-covering with components given by a point stabilizer and a p-Sylow subgroup of G. As an application of our work, we give a brief proof of one of the main results in [20] in Section 11.1.…”
Section: Introductionmentioning
confidence: 99%
“…One of the first motivations for investigating finite groups having normal covering number 2 goes back to a problem in Galois theory (for more details see [8, Section 1]) and is linked to the study of intersective polynomials, that is, integer polynomials having a root modulo p, for every prime number p (see [18] and [74]). Recently, simple groups having normal covering number 2 have been used to construct sparsely connected invariably generating graphs [41]. There is also a unexpected connection between the theory of transitive permutation groups G in which every derangement is a p-element for some prime p and the normal 2-coverings of G. Indeed, as observed in [20], G has such property if and only if G admits a normal 2-covering with components given by a point stabilizer and a p-Sylow subgroup of G. As an application of our work, we give a brief proof of one of the main results in [20] in Section 11.1.…”
Section: Introductionmentioning
confidence: 99%