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: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:20250322T140000
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:23938bc52c75a863d88a1c26cbc76ac5
CATEGORIES:Discrete Math
CREATED:20260318T200526
SUMMARY:Sam Spiro - Generalized Tur\'an Problems for Trees and More
LOCATION:Hill 705
DESCRIPTION:Speaker: Sam Spiro (https://samspiro.xyz/) (Georgia State)\nTitle: Generali
 zed Tur'an Problems for Trees and More\nAbstract:  Given a graph $H$ and a 
 family of graphs $mathcal{F}$, we define the generalized Tur'an number $mat
 hrm{ex}(n,H,mathcal{F})$ to be the maximum number of copies of $H$ in an $m
 athcal{F}$-free graph on $n$ vertices.  We prove a  ``stability'' type resu
 lt for generalized Tur'an problems which relates the generalized Tur'an num
 ber $mathrm{ex}(n,H,mathcal{F})$  to the classical Tur'an number $mathrm{ex
 }(n,mathcal{F})$ whenever $H$ is a tree.  We discuss some applications of t
 his result, as well as some related work around the rational exponents conj
 ecture for general graphs $H$.  Joint work with Sean English.\n
X-ALT-DESC;FMTTYPE=text/html:<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><span style="font-size: 11pt; font-family: Lato; color
 : #000000; background-color: transparent; font-weight: 400; font-style: nor
 mal; font-variant: normal; text-decoration: none; vertical-align: baseline;
  white-space: pre-wrap;">: </span><a href="https://samspiro.xyz/" style="te
 xt-decoration: none;"><span style="font-size: 11pt; font-family: Lato; colo
 r: #cc0000; background-color: transparent; font-weight: 400; font-style: no
 rmal; font-variant: normal; text-decoration: underline; vertical-align: bas
 eline; white-space: pre-wrap;">Sam Spiro</span></a><span style="font-size: 
 11pt; font-family: Lato; color: #212121; background-color: transparent; fon
 t-weight: 400; font-style: normal; font-variant: normal; text-decoration: n
 one; vertical-align: baseline; white-space: pre-wrap;"> (Georgia State)</sp
 an></p><p dir="ltr" style="line-height: 1.38; margin-top: 9pt; margin-botto
 m: 10pt;"><span style="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-spa
 ce: pre-wrap;">Title</span><span style="font-size: 11pt; font-family: Lato;
  color: #000000; background-color: transparent; font-weight: 400; font-styl
 e: normal; font-variant: normal; text-decoration: none; vertical-align: bas
 eline; white-space: pre-wrap;">: Generalized Tur'an Problems for Trees and 
 More</span></p><p dir="ltr" style="line-height: 1.38; margin-top: 9pt; marg
 in-bottom: 0pt;"><span style="font-size: 11pt; font-family: Lato; color: #0
 00000; background-color: transparent; font-weight: bold; font-style: normal
 ; font-variant: normal; text-decoration: none; vertical-align: baseline; wh
 ite-space: pre-wrap;">Abstract</span><span style="font-size: 11pt; font-fam
 ily: Lato; color: #000000; background-color: transparent; font-weight: 400;
  font-style: normal; font-variant: normal; text-decoration: none; vertical-
 align: baseline; white-space: pre-wrap;">:&nbsp; Given a graph $H$ and a fa
 mily of graphs $mathcal{F}$, we define the generalized Tur'an number $mathr
 m{ex}(n,H,mathcal{F})$ to be the maximum number of copies of $H$ in an $mat
 hcal{F}$-free graph on $n$ vertices.&nbsp; We prove a &nbsp;``stability'' t
 ype result for generalized Tur'an problems which relates the generalized Tu
 r'an number $mathrm{ex}(n,H,mathcal{F})$ &nbsp;to the classical Tur'an numb
 er $mathrm{ex}(n,mathcal{F})$ whenever $H$ is a tree.&nbsp; We discuss some
  applications of this result, as well as some related work around the ratio
 nal exponents conjecture for general graphs $H$.&nbsp; Joint work with Sean
  English.</span></p>
DTSTAMP:20260826T211417
DTSTART;TZID=America/New_York:20260323T140000
DTEND;TZID=America/New_York:20260323T150000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR