BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.18.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20261208T163000
DTEND;TZID=Asia/Seoul:20261208T173000
DTSTAMP:20261014T024439Z
CREATED:20261014T024439Z
LAST-MODIFIED:20261014T024439Z
UID:13619-1796747400-1796751000@dimag.ibs.re.kr
SUMMARY:Mingyuan Rong\, The codegree Turán density of tight cycles
DESCRIPTION:The codegree Turán density γ(F) of a k-uniform hypergraph F is the smallest γ ≥ 0 with the following property: if every set of k−1 vertices in an n-vertex k-uniform hypergraph H lies in at least (γ+o(1))n edges\, then H contains a copy of F for all sufficiently large n. Piga\, Sanhueza-Matamala\, and Schacht proved that this density is 1/3 for all sufficiently long 3-uniform tight cycles whose lengths are not divisible by 3. In this talk\, I will discuss extensions of this result to higher uniformities\, where we determine the codegree Turán density of tight cycles for a broad range of cycle lengths. I will explain the structural characterization underlying the upper bounds and the constructions used for the lower bounds. This is joint work with Jie Ma.
URL:https://dimag.ibs.re.kr/event/2026-12-08/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR