BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Zilin Jiang (Massachusetts Institute of Technology)
DTSTART:20200813T020000Z
DTEND:20200813T030000Z
DTSTAMP:20260423T021019Z
UID:SCMSComb/8
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SCMSComb/8/"
 >Negligible obstructions and Turán exponents</a>\nby Zilin Jiang (Massach
 usetts Institute of Technology) as part of SCMS Combinatorics Seminar\n\n\
 nAbstract\nThe conjecture on the realizability of rational exponents state
 s that for every rational number r in (1\,2) there is a graph F such that 
 ex(n\, F) = Θ(n^r). In their beautiful work\, Bukh and Conlon resolved a 
 weaker version of the conjecture\, where F is allowed to be a family of gr
 aphs. Subsequent work has been focusing on narrowing this family down to a
  single graph. We formulate a framework\, that is taking shape in recent w
 ork\, to attack the conjecture\, and we showcase an application of the fra
 mework to obtain infinitely many new Turán exponents.\n\nJoint work with 
 Tao Jiang and Jie Ma.\n
LOCATION:https://researchseminars.org/talk/SCMSComb/8/
END:VEVENT
END:VCALENDAR