Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-26T23:31:50.182Z Has data issue: false hasContentIssue false
  • English
  • Français

Cayley graphs and group presentations

Published online by Cambridge University Press:  24 October 2008

Richard M. Thomas
Richard M. Thomas
Affiliation:
Department of Computing Studies, University of Leicester, Leicester LEI 1RH
Get access Rights & Permissions [Opens in a new window]

Extract

The aim of this paper is to prove the following result:

Theorem. Let G be the group defined by the presentation

where each ui is a word in the xj and , and suppose that there is a homomorphism σ such that the orders of the elements respectively. Let If G is finite, then α−d + 1 > 0 and .

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 103 , Issue 3 , May 1988 , pp. 385 - 387
Copyright
Copyright © Cambridge Philosophical Society 1988

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] Baumslag, G., Morgan, J. W. and Shalen, P. B.. Generalized triangle groups. Math. Proc. Cambridge Philos. Soc. 102 (1987), 25–31.Google Scholar
[2] Coxeteb, H. S. M. and Moser, W. O. J.. Generators and Relations for Discrete Groups, 4th edition (Springer-Verlag, 1984).Google Scholar
[3] Habary, F.. Graph Theory (Addison-Wesley, 1969).Google Scholar