Random lifts of graphs: Independence and chromatic number
- 3 December 2001
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 20 (1) , 1-22
- https://doi.org/10.1002/rsa.10003
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On Brooks' Theorem for Sparse GraphsCombinatorics, Probability and Computing, 1995
- Graph Coloring ProblemsPublished by Wiley ,1994
- A generalized van Kampen-Flores theoremProceedings of the American Mathematical Society, 1991
- A generalized kneser conjectureJournal of Combinatorial Theory, Series B, 1990
- The chromatic number of random graphsCombinatorica, 1988