1 paper · 1 filter
Roman Glebov, Zur Luria, Michael Simkin
Consider the random process in which the edges of a graph G are added one by one in a random order. A classical result states that if G is the complete graph K2n or the co…