Graph Colourings and Ramsey's Theorem
Duncan McCoy (University of Glasgow)
Friday 19th April, 2013 16:00-17:00 Maths 516
Abstract
Ramsey's Theorem for graphs states that any colouring on a sufficiently large complete graph must necessarily contain a monochromatic complete subgraph of a given size. This talk will contain a proof of Ramsey's Theorem, some restrictions on the size of the Ramsey numbers, including Erdos's lower bound obtained through probabilistic methods, and possibly some applications.
Add to your calendar
Download event information as iCalendar file (only this event)