BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jie Han (University of Rhode Island)
DTSTART:20201105T070000Z
DTEND:20201105T080000Z
DTSTAMP:20260423T021016Z
UID:SCMSComb/19
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SCMSComb/19/
 ">$F$-factors in graphs with randomness conditions</a>\nby Jie Han (Univer
 sity of Rhode Island) as part of SCMS Combinatorics Seminar\n\n\nAbstract\
 nThe celebrated Hajnal-Szemerédi Theorem is a cornerstone in extremal gra
 ph theory and has many applications and extensions. We will focus on a cla
 ss of extensions where the host graph enjoys mild randomness conditions (e
 .g.\, does not have large independent set\, or contains a small amount of 
 random edges) and discuss some recent problems and developments.\n\npasswo
 rd 121323\n
LOCATION:https://researchseminars.org/talk/SCMSComb/19/
END:VEVENT
END:VCALENDAR