Proof of the Lovász conjecture
暂无分享,去创建一个
[1] G. Ziegler,et al. Generalized Kneser coloring theorems with combinatorial proofs , 2001, math/0103146.
[2] R. Ho. Algebraic Topology , 2022 .
[3] E. Babson,et al. Complexes of graph homomorphisms , 2003, math/0310056.
[4] Alexander Engström. A short proof of a conjecture on the connectivity of graph coloring complexes , 2006 .
[5] R. Živaljević. Parallel transport of $Hom$-complexes and the Lovasz conjecture , 2005, math/0506075.
[6] A simple proof for folds on both sides in complexes of graph homomorphisms , 2004, math/0408262.
[7] Dmitry N. Kozlov,et al. Complexes of Directed Trees , 1999, J. Comb. Theory A.
[8] Dmitry N. Kozlov,et al. Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes , 2005 .
[9] Dmitry N. Kozlov,et al. Topological obstructions to graph colorings , 2003 .
[10] Higher connectivity of graph coloring complexes , 2004, math/0410335.
[11] László Lovász,et al. Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.
[12] D. Quillen,et al. Higher algebraic K-theory: I , 1973 .
[13] P. E. Conner,et al. Fixed point free involutions and equivariant maps , 1960 .