Problems of Connectivity between the Sylow Graph,the Prime Graph and the Non-Commuting Graph of a Group

HTML  XML Download Download as PDF (Size: 137KB)  PP. 391-396  
DOI: 10.4236/apm.2012.26058    5,503 Downloads   9,758 Views  Citations
Author(s)

ABSTRACT

The Sylow graph of a finite group originates from recent investigations on certain classes of groups, defined in terms of normalizers of Sylow subgroups. The connectivity of this graph has been proved only last year with the use of the classification of finite simple groups (CFSG). A series of interesting questions arise naturally. First of all, it is not clear whether it is possible to avoid CFSG or not. On the other hand, what happens for infinite groups? Since the status of knowledge of the non-commuting graph and of the prime graph is satisfactory, is it possible to find relations between these two graphs and the Sylow graph? In the present note we make the point of the situation and formulate the above questions in appropriate way.

Share and Cite:

F. Russo, "Problems of Connectivity between the Sylow Graph,the Prime Graph and the Non-Commuting Graph of a Group," Advances in Pure Mathematics, Vol. 2 No. 6, 2012, pp. 391-396. doi: 10.4236/apm.2012.26058.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.