The neighborhood complex of a random graph

Journal of Combinatorial Theory. Series A

Volumn 114, Issue 2, 2007, Pages 380-387

  Kahle, Matthew ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Graph coloring; Morphism complexes; Random graphs

Indexed keywords

EID: 33750833972     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2006.05.004     Document Type: Article

References (13)

1. Babson E., and Kozlov D. Topological obstructions to graph coloring. Electron. Res. Announc. Amer. Math. Soc. 9 (2003) 61-68
2. Babson E., and Kozlov D. Complexes of graph homomorphisms. Israel J. Math. 152 (2006) 285-312
3. E. Babson, D. Kozlov, Proof of the Lovász conjecture, arXiv: math.CO/0402395, Ann. of Math., in press
4. Bollobás B. Random Graphs. second ed. (2001), Cambridge Univ. Press
5. Björner A. Topological methods. Handbook of Combinatorics, vol. 2 (1996) 1819-1872
6. P. Csorba, Homotopy types of box complexes, arXiv: math.CO/0406118, Combinatorica, in press
7. Csorba P., Lange C., Schurr I., and Wassmer A. Box complexes, neighborhood complexes, and the chromatic number. J. Combin. Theory Ser. A 108 (2004) 159-168
8. Dochtermann A. Hom complexes and homotopy theory in the category of graphs. arXiv:. math.CO/0605275
9. C. Hoffman, M. Kahle, Simple connectivity of random 2-dimensional simplicial complexes, in preparation
10. M. Kahle, Topology of random clique complexes, in preparation
11. Lovász L. Kneser's conjecture, chromatic number, and homotopy. J. Combin. Theory Ser. A 25 (1978) 319-324
12. N. Linial, R. Meshulam, Homological connectivity of random 2-complexes, Combinatorica, in press
13. C. Schultz, The relative strength of graph coloring obstructions, preprint, 2006