Two bounds on the noncommuting graph
Erdős introduced the noncommuting graph in order to study the number of commuting elements in a finite group. Despite the use of combinatorial ideas, his methods involved several techniques of classical analysis. The interest for this graph has become relevant during the last years for various reaso...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2015-04-01
|
| Series: | Open Mathematics |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/math-2015-0027 |