Student Seminar
Speaker: Madhav Varshney, IIT Bombay
Host: Suman Kumar Sahoo
Title: Games in Graph Theory: Ramsey Numbers, Strategy Stealing and Potential Function Arguments
Time, day and date: 5:15:00 PM – 6:15:00 PM, Friday, September 04
Venue: Room 215
Abstract: We analyze two-player competitive edge-coloring games played on a complete graph, examining the core theoretical principles governing these graph games. We frame bounds using diagonal Ramsey numbers and apply the Erdős–Selfridge potential argument directly to the edge set of the graph to derive the asymptotic winning thresholds.