BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//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:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20190312T163000
DTEND;TZID=Asia/Seoul:20190312T173000
DTSTAMP:20260423T123352
CREATED:20190226T113020Z
LAST-MODIFIED:20240707T090549Z
UID:635-1552408200-1552411800@dimag.ibs.re.kr
SUMMARY:Andreas Holmsen\, Large cliques in hypergraphs with forbidden substructures
DESCRIPTION:A result due to Gyárfás\, Hubenko\, and Solymosi\, answering a question of Erdős\, asserts that if a graph $G$ does not contain $K_{2\,2}$ as an induced subgraph yet has at least $c\binom{n}{2}$ edges\, then $G$ has a complete subgraph on at least $\frac{c^2}{10}n$ vertices. In this paper we suggest a “higher-dimensional” analogue of the notion of an induced $K_{2\,2}$\, which allows us to extend their result to $k$-uniform hypergraphs. Our result also has interesting consequences in topological combinatorics and abstract convexity\, where it can be used to answer questions by Bukh\, Kalai\, and several others.
URL:https://dimag.ibs.re.kr/event/2019-03-12/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR