Random Lifts of Graphs: Independence and Chromatic Number

Random Structures and Algorithms

Volumn 20, Issue 1, 2002, Pages 1-22

  Amit, Alon ^a   Linial, Nathan ^a   Matoušek, Jiří ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036103291     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10003     Document Type: Article

References (10)

1. A. Amit and N. Linial, Random lifts of graphs: General theory and connectivity, Combinatorica, to appear.
2. A. Amit and N. Linial, Random lifts of graphs: Edge-expansion, to appear.
3. B. Bollobás, The chromatic number of random graphs, Combinatorica 8 (1988), 49-55.
4. T.R. Jensen and B. Toft, Graph coloring problems, Wiley-Interscience, New York, 1994.
5. J.H. Kim, On Brooks' theorem for sparse graphs, Combin Probab Comput 4(2) (1995), 97-132.
6. J. Matoušek, Topological methods in combinatorics and geometry. Lecture notes available at: http://www.ms.mff.cuni.cz/acad/kam/matousek/kt.ps.gz, 1994.
7. A.V. Pyatkin, Example of the graph with cover degeneracy less than chromatic number. Manuscript, Institute of Mathematics, Novosibirsk, 2000.
8. K.S. Sarkaria, A generalized Kneser conjecture, J Combinatorial Theory 49 (1990), 236-240.
9. K.S. Sarkaria, A generalized van Kampen-Flores theorem, Proc Amer Math Soc 11 (1991), 559-565.
10. N.C. Wormald, "Models of random regular graphs," Surveys in combinatorics, J.D. Lamb and D.A. Preece (Editors), London Mathematical Society Lecture Note Series, 1999, vol. 276, pp. 239-298.