The generating graph of a profinite group
From MaRDI portal
Abstract: Let be 2-generated group. The generating graph of is the graph whose vertices are the elements of and where two vertices and are adjacent if This definition can be extended to a 2-generated profinite group considering in this case topological generation. We prove that the set of non-isolated vertices of is closed in and that, if is prosoluble, then the graph obtained from by removing its isolated vertices is connected with diameter at most 3. However we construct an example of a 2-generated profinite group with the property that has connected components. This implies that the so called "swap conjecture" does not hold for finitely generated profinite groups. We also prove that if an element of has finite degree in the graph then is finite.
Recommendations
Cites work
- Finite groups admitting a fixed-point-free automorphism group
- The diameter of the generating graph of a finite soluble group
- The generating graph of finite soluble groups.
- The non-isolated vertices in the generating graph of a direct powers of simple groups.
- The swap conjecture
- The swap conjecture of Tennant and Turner
- Zu einem von B. H. und H. Neumann gestellten Problem
Cited in
(4)
This page was built for publication: The generating graph of a profinite group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198267)