BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20231118T140000
RDATE:20240310T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20241103T010000
RDATE:20250309T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20251102T010000
RDATE:20260308T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20261101T010000
RDATE:20270314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20271107T010000
RDATE:20280312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20281105T010000
RDATE:20290311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20240310T030000
RDATE:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20250309T030000
RDATE:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RDATE:20261101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20270314T030000
RDATE:20271107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20280312T030000
RDATE:20281105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:b372c359f93a4f6934083f557c281d2e
CATEGORIES:Discrete Math
CREATED:20241113T160515
SUMMARY:Sam Spiro - Extremal Problems for Random Objects 
LOCATION:Hill 705
DESCRIPTION:<p dir="ltr" style="line-height: 1.38; margin-top: 9pt; margin-bottom: 0pt;
 "><span style="font-size: 11pt; font-family: Lato; color: #000000; backgrou
 nd-color: transparent; font-weight: bold; font-style: normal; font-variant:
  normal; text-decoration: none; vertical-align: baseline; white-space: pre-
 wrap;">Speaker: </span><a href="https://samspiro.xyz/" style="text-decorati
 on: none;"><span style="font-size: 11pt; font-family: Lato; color: #cc0000;
  background-color: transparent; font-weight: 400; font-style: normal; font-
 variant: normal; text-decoration: underline; vertical-align: baseline; whit
 e-space: pre-wrap;">Sam Spiro</span></a><span style="font-size: 11pt; font-
 family: Lato; color: #000000; background-color: transparent; font-weight: 4
 00; font-style: normal; font-variant: normal; text-decoration: none; vertic
 al-align: baseline; white-space: pre-wrap;"> (Rutgers)</span></p><p dir="lt
 r" style="line-height: 1.38; margin-top: 9pt; margin-bottom: 10pt;"><span s
 tyle="font-size: 11pt; font-family: Lato; color: #000000; background-color:
  transparent; font-weight: bold; font-style: normal; font-variant: normal; 
 text-decoration: none; vertical-align: baseline; white-space: pre-wrap;">Ti
 tle</span><span style="font-size: 11pt; font-family: Lato; color: #000000; 
 background-color: transparent; font-weight: 400; font-style: normal; font-v
 ariant: normal; text-decoration: none; vertical-align: baseline; white-spac
 e: pre-wrap;">: Extremal Problems for Random Objects&nbsp;</span></p><p dir
 ="ltr" style="line-height: 1.38; margin-top: 9pt; margin-bottom: 0pt;"><spa
 n style="font-size: 11pt; font-family: Lato; color: #000000; background-col
 or: transparent; font-weight: bold; font-style: normal; font-variant: norma
 l; text-decoration: none; vertical-align: baseline; white-space: pre-wrap;"
 >Abstract</span><span style="font-size: 11pt; font-family: Lato; color: #00
 0000; background-color: transparent; font-weight: 400; font-style: normal; 
 font-variant: normal; text-decoration: none; vertical-align: baseline; whit
 e-space: pre-wrap;">: Broadly speaking, extremal combinatorics studies how 
 ``large'' combinatorial objects can be, such as determining the maximum num
 ber of edges that a graph with a given set of properties can have.&nbsp; In
  contrast, the field of probabilistic combinatorics studies properties of r
 andom discrete objects, such as random graphs and random permutations.&nbsp
 ; In this talk, we study several problems at the intersection of these area
 s.&nbsp; In particular, we consider the maximum expected score one can obta
 in in a certain card guessing game, as well as the problem of finding large
  $F$-free subgraphs of random graphs. </span></p>
DTSTAMP:20260827T142725
DTSTART;TZID=America/New_York:20241118T140000
DTEND;TZID=America/New_York:20241118T150000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR