A correction to “Equivariant cohomology and lower bounds for chromatic numbers”
暂无分享,去创建一个
We introduce a general topological method for obtaining a lower bound of the chromatic number of an «-graph. We present numerical lower bounds for intersection «-graphs.
[1] P. Erdos. Problems and Results in Combinatorial Analysis , 2022 .
[2] Noga Alon,et al. The chromatic number of kneser hypergraphs , 1986 .
[3] Jon P. May. Simplicial objects in algebraic topology , 1993 .
[4] László Lovász,et al. Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.
[5] I. Kríz. A correction to “Equivariant cohomology and lower bounds for chromatic numbers” , 1992 .