Alice and Bob are playing a game on a d-regular graph G that has n vertices and d - Cloga n for some large constant C. They take turns claiming edges of G. Once an edge is claimed, it can't be reclaimed by the other player. Alice is trying to maximize the minimum degree of the subgraph made from her edges and Bob is trying to minimize the minimum degree of Alice's graph. (a) How large a minimum degree do you expect Alice to make? (This question isn't rigorously phrased, so you don't need to give a rigorous answer.) Alice and Bob are playing a game on a d-regular graph G that has n vertices and d - Cloga n for some large constant C. They take turns claiming edges of G. Once an edge is claimed, it can't be reclaimed by the other player. Alice is trying to maximize the minimum degree of the subgraph made from her edges and Bob is trying to minimize the minimum degree of Alice's graph. (a) How large a minimum degree do you expect Alice to make? (This question isn't rigorously phrased, so you don't need to give a rigorous answer.)