Expected Chromatic Number of Random Subgraphs

Ross Berkowitz, Pat Devlin, Catherine Lee +2

Given a graph $G$ and $p\in [0,1]$, let $G_p$ denote the random subgraph of $G$ obtained by keeping each edge independently with probability $p$. Alon, Krivelevich, and Sudokov pr…