Given a graph G and p ∈ [0, 1], let Gp denote the random subgraph of G obtained by keeping each edge independently with probability p. Alon, Krivelevich, and Sudokov. We prove a new spectral lower bound on E[χ(Gp)], as progress towards Bukh's conjecture. We also propose the stronger conjecture that for any fixed p ≤ 1/2, among all graphs of fixed chromatic number, E[χ(Gp)] is minimized by the complete graph. We prove this stronger conjecture when G is planar or χ(G) < 4. We also consider weaker lower bounds on E[χ(Gp)] proposed in a recent paper by Shinkar [17]; we answer two open questions posed in [17] negatively and propose a possible refinement of one of them.