Journal article
Sets of elements that pairwise generate a linear group
- Abstract:
-
Let G be any of the groups(P)GL(n,q),(P)SL(n,q). Define a (simple) graph Γ =Γ (G) on the set of elements of G by connecting two vertices by an edge if and only if they generate G. Suppose that n is at least 12. Then the maximum size of a complete subgraph in Γ is equal to the chromatic number of Γ if n ≢2 (mod 4), or if n≡2 (mod 4), q is odd and G =(P)SL(n,q). This work was motivated by a question of Blackburn.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, pdf, 252.6KB, Terms of use)
-
- Publisher copy:
- 10.1016/j.jcta.2007.07.002
Authors
+ Scatcherd European Scholarship (University of Oxford)
More from this funder
- Funding agency for:
- Evseev, A
- Publisher:
- Elsevier
- Journal:
- Journal of Combinatorial Theory, Series A More from this journal
- Volume:
- 115
- Issue:
- 3
- Pages:
- 442-465
- Publication date:
- 2008-04-01
- Edition:
- Publisher's version
- DOI:
- ISSN:
-
0097-3165
- Language:
-
English
- Keywords:
- Subjects:
- UUID:
-
uuid:64082931-e9be-4c1c-8546-6459f3d1f2f4
- Local pid:
-
ora:8742
- Deposit date:
-
2014-07-08
Terms of use
- Copyright holder:
- Elsevier Inc
- Copyright date:
- 2007
- Notes:
- Copyright 2007 Elsevier B.V. All rights reserved. Re-use of this article is permitted in accordance with the Terms and Conditions set out at http://www.elsevier.com/open-access/userlicense/1.0/
- Licence:
- Other
If you are the owner of this record, you can report an update to it here: Report update to this record