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:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20210407T170000
DTEND;TZID=Asia/Seoul:20210407T180000
DTSTAMP:20260420T162043
CREATED:20210301T235812Z
LAST-MODIFIED:20240705T190042Z
UID:3701-1617814800-1617818400@dimag.ibs.re.kr
SUMMARY:Michał Pilipczuk\, Structural properties of powers of sparse graphs
DESCRIPTION:For a graph G and an integer d\, the dth power of G is the graph $G^d$ on the same vertex set as G where two vertices are considered adjacent if and only if they are at distance at most d in G. Assuming that G is sparse\, what can we say about the structure in $G^d$? Certainly $G^d$ can be dense\, as the square of a star is a complete graph\, but $G^d$ still retains many properties that can be derived from the sparsity of G. We will present some recent results in this spirit\, in particular connected to colorings and to the Erdős-Hajnal property\, assuming that G is drawn from a fixed class of bounded expansion or from a fixed nowhere dense class. The talk will be based on the recent papers: “Clustering Powers of Sparse Graphs” (with J. Nešetřil\, P. Ossona de Mendez\, and X. Zhu) and “Erdős-Hajnal properties for powers of sparse graphs” (with M. Briański\, P. Micek\, and M. Seweryn).
URL:https://dimag.ibs.re.kr/event/2021-04-07/
LOCATION:Zoom ID: 869 4632 6610 (ibsdimag)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
END:VCALENDAR