@inproceedings{ed75129953e34e74b698db5fd08488fd,

title = "Random lifts of graphs",

abstract = "We describe here a simple probabilistic model for graphs that are lifts of a fixed base graph G, i.e., those graphs from which there is a covering man onto G. Our aim is to investigate the properties of typical graphs in this class. In particular, we show that almost every lift of G is &dgr;(G)-connected where &dgr;(G) is the minimal degree of G. We calculate the typical edge expansion of lifts of the bouguet Bd and",

keywords = "Algorithms, Theory",

author = "Alon Amit and Nathan Linial and Ji{\v r}{\'i} Matou{\v s}ek and Eyal Rozenman",

year = "2001",

language = "American English",

isbn = "0898714907",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

pages = "883--894",

booktitle = "Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms",

note = "2001 Operating Section Proceedings, American Gas Association ; Conference date: 30-04-2001 Through 01-05-2001",

}