On finite simple groups and Kneser graphs

被引：0

作者：

Andrea Lucchini

Attila Maróti

机构：

[1] Dipartimento di Matematica Pura ed Applicata,Alfréd Rényi Institute of Mathematics

[2] Hungarian Academy of Sciences,Department of Mathematics

[3] University of Southern California,undefined

来源：

Journal of Algebraic Combinatorics | 2009年 / 30卷

关键词：

Kneser graph; Chromatic number; Finite simple group; Special linear group; Symmetric group;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

For a finite group G let Γ(G) be the (simple) graph defined on the elements of G with an edge between two (distinct) vertices if and only if they generate G. The chromatic number of Γ(G) is considered for various non-solvable groups G.

引用

页码：549 / 566

页数：17

共 33 条

[21]

Haxell P.E.(undefined)Covering the symmetric groups with proper subgroups undefined undefined undefined-undefined

[22]

Kleidman P.B.(undefined)The clique complex and hypergraph matching undefined undefined undefined-undefined

[23]

Liebeck M.W.(undefined)On a class of doubly transitive groups undefined undefined undefined-undefined

[24]

Shalev A.(undefined)Groups as the union of proper subgroups undefined undefined undefined-undefined

[25]

Liebeck M.W.(undefined)An extremal problem in graph theory undefined undefined undefined-undefined

[26]

Shalev A.(undefined)undefined undefined undefined undefined-undefined

[27]

Lovász L.(undefined)undefined undefined undefined undefined-undefined

[28]

Maróti A.(undefined)undefined undefined undefined undefined-undefined

[29]

Maróti A.(undefined)undefined undefined undefined undefined-undefined

[30]

Meshulam R.(undefined)undefined undefined undefined undefined-undefined

← 1 2 3 4 →