BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20211123T093000
DTEND;TZID=America/New_York:20211123T103000
DTSTAMP:20240226T111143Z
CREATED:20240213T065330Z
LAST-MODIFIED:20240226T111143Z
UID:10002138-1637659800-1637663400@cmsa.fas.harvard.edu
SUMMARY:Prague dimension of random graphs
DESCRIPTION:Abstract: The Prague dimension of graphs was introduced by Nesetril\, Pultr and Rodl in the 1970s: as a combinatorial measure of complexity\, it is closely related to clique edges coverings and partitions. Proving a conjecture of Furedi and Kantor\, we show that the Prague dimension of the binomial random graph is typically of order n/(log n) for constant edge-probabilities. The main new proof ingredient is a Pippenger-Spencer type edge-coloring result for random hypergraphs with large uniformities\, i.e.\, edges of size O(log n).
URL:https://cmsa.fas.harvard.edu/event/11-23-21-combinatorics-physics-and-probability-seminar/
CATEGORIES:Combinatorics Physics and Probability
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Combinatorics-Physics-and-Probability-Seminar-11.23.21-1.png
END:VEVENT
END:VCALENDAR