On finite simple groups and Kneser graphs.

DOI10.1007/S10801-009-0177-0MaRDI QIDQ968241zbMATH OpenOpenAlexFDO

Authors Andrea Lucchini, Attila Maróti

Publication date 5 May 2010

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10801-009-0177-0

zbMATH Keywords

symmetric groupsfinite simple groupschromatic numbersKneser graphsspecial linear groups

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Simple groups: alternating groups and groups of Lie type (20D06) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05) Linear algebraic groups over finite fields (20G40)

Recommendations

• Some results and questions related to the generating graph a finite group.
• On the clique number of the generating graph of a finite group
• On the generating graph of a simple group
• Sets of elements that pairwise generate a linear group
• On the chromatic number of \(q\)-Kneser graphs

Cites work

• scientific article; zbMATH DE number 3135133 (Why is no real title available?)
• scientific article; zbMATH DE number 3811825 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• A condition for matchability in hypergraphs
• A note on vertex list colouring
• Colouring lines in projective space
• Covering the symmetric groups with proper subgroups.
• Groups as the union of proper subgroups.
• Kneser's conjecture, chromatic number, and homotopy
• Maximal subgroups of symmetric groups
• On a class of doubly transitive groups
• On the Dirichlet polynomial of finite groups of Lie type.
• On the Erdös-Stone Theorem
• On the Structure of Edge Graphs
• On the \(n\)-covers of exceptional groups of Lie type.
• On the covers of finite groups.
• On the orders of primitive groups
• On the structure of linear graphs
• Sets of elements that pairwise generate a linear group
• Sets of permutations that generate the symmetric group pairwise.
• Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky
• Subgroup coverings of some linear groups
• The Erdős-Ko-Rado theorem for vector spaces
• The clique complex and hypergraph matching
• The maximal subgroups of the Chevalley groups \(G_ 2(q)\) with q odd, the Ree groups \(2G_ 2(q)\), and their automorphism groups

Cited in

(8)

• On the Soluble Graph of a Finite Simple Group
• Some results on the join graph of finite groups
• On Integers that are Covering Numbers of Groups
• Connectivity of generating graphs of nilpotent groups
• Some results and questions related to the generating graph a finite group.
• The generating graph of finite soluble groups.
• Groups, graphs, and the Hanna Neumann conjecture.
• Covering certain monolithic groups with proper subgroups.

This page was built for publication: On finite simple groups and Kneser graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968241)