Random Graphs, Retractions and Clique Graphs

We found d1=d1(n,p) and d2=d2(n,p) such that almost every (random) graph G∈G(n,p) has retractions to d-dimensional octahedra Od for every integer d satisfying d1