³ÉÈË´óƬ

Math & Stats Number Theory Seminar
Thursday, September 26, 2024

Time: 4:30 p.m.  Place: Jeffery Hall, Room 202

Speaker: Ram Murty (³ÉÈË´óƬ)

Title: TURAN'S THEOREM ON MAXIMAL CLIQUES IN GRAPHS

Abstract: In 1941, Turan gave an upper bound for the number of edges of a graph that does not contain a complete subgraph of prescribed size. This theorem has had many applications and proofs that it has even made it into "Proofs from THE Book''. I will discuss a few of these proofs in the talk. No knowledge of graph theory is assumed.