Sets of elements that pairwise generate a linear group

JR Britnell, A Evseev, RM Guralnick, PE Holmes, A Maroti

Research output: Contribution to journalArticle (Academic Journal)peer-review

24 Citations (Scopus)

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 , or if , q is odd and G=(P)SL(n,q). This work was motivated by a question of Blackburn.
Translated title of the contributionSets of elements that pairwise generate a linear group
Original languageEnglish
Pages (from-to)442 - 465
Number of pages24
JournalJournal of Combinatorial Theory, Series A
Volume115, issue 3
DOIs
Publication statusPublished - Apr 2008

Bibliographical note

Publisher: Elsevier

Fingerprint Dive into the research topics of 'Sets of elements that pairwise generate a linear group'. Together they form a unique fingerprint.

Cite this