BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UNL_UCBCN//NONSGML UNL Event Publisher//EN
X-WR-CALNAME:Math
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTART:20240322T210000Z
UID:177362@events.unl.edu
DTSTAMP:20231130T124557Z
ORGANIZER;CN=Petronela Radu:
SUMMARY:Rowlee Lecture - Alan Frieze\, Carnegie Mellon University
STATUS:CONFIRMED
DESCRIPTION:This lecture will give some simple examples of the use of the p
robabilistic method. It uses tools from probability to prove the existence
of combinatorial objects that can be hard to find deterministically. This
idea was pioneered by the great Hungarian mathematician Paul Erdos and it
is now part of the standard toolkit for combinatorialists. We will consid
er four problems where we can obtain results very easily via random method
s. On the other hand\, in these instances\, non-random constructions seem
much harder to obtain.
LOCATION:Avery Hall Room 115
URL://events.unl.edu/math/2024/03/22/177362/
DTEND:20240322T220000Z
END:VEVENT
END:VCALENDAR