On finite simple groups and Kneser graphs.

DOI10.1007/S10801-009-0177-0zbMATH Open1206.20024OpenAlexW1976712133MaRDI QIDQ968241FDOQ968241

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

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

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)

Cites Work

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

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.
• Covering Certain Monolithic Groups with Proper Subgroups
• The generating graph of finite soluble groups.
• Groups, graphs, and the Hanna Neumann conjecture.

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)