Abstrakt
For a graph G, a random n-lift of G has the vertex set V(G)x[n] and for each edge uv of G, there is a random matching between {u}x[n] and {v}x[n]$. We present bounds on the chromatic number and on the independence number of typical random lifts.
