On finite simple groups and Kneser graphs.
DOI10.1007/s10801-009-0177-0zbMath1206.20024OpenAlexW1976712133MaRDI QIDQ968241
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
Linear algebraic groups over finite fields (20G40) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Simple groups: alternating groups and groups of Lie type (20D06)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- Colouring lines in projective space
- On the Dirichlet polynomial of finite groups of Lie type.
- Sets of permutations that generate the symmetric group pairwise.
- The clique complex and hypergraph matching
- The Erdős-Ko-Rado theorem for vector spaces
- The maximal subgroups of the Chevalley groups \(G_ 2(q)\) with q odd, the Ree groups \(2G_ 2(q)\), and their automorphism groups
- Covering the symmetric groups with proper subgroups.
- On the orders of primitive groups
- A condition for matchability in hypergraphs
- Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky
- Maximal subgroups of symmetric groups
- Sets of elements that pairwise generate a linear group
- A Note on Vertex List Colouring
- On the Erdös-Stone Theorem
- Groups as the union of proper subgroups.
- On the Structure of Edge Graphs
- Subgroup coverings of some linear groups
- On the structure of linear graphs
- On a class of doubly transitive groups
This page was built for publication: On finite simple groups and Kneser graphs.
