On Coloring Random Subgraphs of a Fixed Graph

Igor Shinkar

Given an arbitrary graph $G$ we study the chromatic number of a random subgraph $G_{1/2}$ obtained from $G$ by removing each edge independently with probability $1/2$. Studying $χ(…