BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
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:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20251111T163000
DTEND;TZID=Asia/Seoul:20251111T173000
DTSTAMP:20260416T124006
CREATED:20250923T135954Z
LAST-MODIFIED:20250923T135954Z
UID:11635-1762878600-1762882200@dimag.ibs.re.kr
SUMMARY:Simón Piga\, Turán problem in hypergraphs with quasirandom links
DESCRIPTION:Given a $k$-uniform hypergraph $F$\, its Turán density $\pi(F)$ is the infimum over all $d\in [0\,1]$ such that any $n$-vertex $k$-uniform hypergraph $H$ with at least $d\binom{n}{k}+o(n^k)$ edges contains a copy of $F$. While Turán densities are generally well understood for graphs ($k=2$)\, the problem becomes notoriously difficult for $k\geq 3$\, even for small hypergraphs. \nWe study two well-known variants of this Turán problem for hypergraphs: first\, under minimum codegree conditions and\, second\, with a quasirandom edge distribution. Each variant defines a distinct extremal parameter\, generalising the classical Turán density. Here we present recent results in both settings\, with a particular emphasis on the case of hypergraphs where every link is itself quasirandom. Our results include exact solutions for key hypergraphs and general results about the behaviour of the Turán density functions.
URL:https://dimag.ibs.re.kr/event/2025-11-11/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR