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;VALUE=DATE:20211020
DTEND;VALUE=DATE:20211023
DTSTAMP:20260423T020916
CREATED:20211019T150000Z
LAST-MODIFIED:20240707T092447Z
UID:4324-1634688000-1634947199@dimag.ibs.re.kr
SUMMARY:Young Researchers in Extremal and Probabilistic Combinatorics
DESCRIPTION:The aim of the Young Researchers in Extremal and Probabilistic Combinatorics is to bring together early career researchers working on these topics.  The workshop will consist of several  25 minute talks across three days from October 20 to 22\, 2021.  Due to Covid the workshop will be held online. \n \nInvited Speakers & Program\nOct. 20 Wednesday 4 PM (KST) – 8 PM (KST)\n\nAndrzej Grzesik (Jagiellonian University): Degenerated generalized Turán numbers of cycles\, 4:00-4:25\nJan Volec (Czech Technical University): Existence of common graphs with large chromatic number\, 4:30-4:55\nBalázs Patkós (Rényi Institute): Vector sum-intersection theorems\, 5:00-5:25\nIstván Tomon (ETH Zurich): Small doubling\, atomic structure and $\ell$-divisible set families\, 5:30-5:55\nMichael Anastos (Freie Universität Berlin): Longest Cycles in Sparse Random Graphs and Where to Find Them\, 6:30-6:55\nAdam Zsolt Wagner (Tel Aviv University): Constructions in combinatorics via neural networks\, 7:00-7:25\nYelena Yuditsky (Université libre de Bruxelles): On multicolor Ramsey numbers and subset-coloring of hypergraphs\, 7:30-7:55\n\nOct. 21 Thursday 4 PM (KST) – 8 PM (KST)\n\nKevin Hendrey (IBS Discrete Mathematics Group): Extremal functions for sparse minors\, 4:00-4:25\nSimona Boyadzhiyska (Freie Universität Berlin): Ramsey simplicity of random graphs\, 4:30-4:55\nShagnik Das (National Taiwan University): Schur’s Theorem in randomly perturbed sets\, 5:00-5:25\nTony Huynh (Monash University): Subgraph densities in minor-closed classes (and beyond)\, 5:30-5:55\nAnder Lamaison (Masaryk University): Hypergraphs with minimum uniform Turán density\, 6:30-6:55\nBen Lund (IBS Discrete Mathematics Group): Maximal 3-wise intersecting families\, 7:00-7:25\nLiana Yepremyan (London School of Economics): Enumerating independent sets in Abelian Cayley graphs\, 7:30-7:55\n\nOct. 22 Friday 4 PM (KST) – 8 PM (KST)\n\nAndrey Kupavskii (CNRS): Binary scalar products\, 4:00-4:25\nDániel Gerbner (Rényi Institute): Exact results for generalized Turán problems\, 4:30-4:55\nOliver Janzer (University of Cambridge): Tiling with monochromatic bipartite graphs of bounded maximum degree\, 5:00-5:25\nNika Salia (Rényi Institute): Pósa-type results for Berge Hypergraphs\, 5:30-5:55\nDebsoumya Chakraborti (IBS Discrete Mathematics Group): Mixing time and expanders\, 6:30-6:55\nWei-Tian Li (National Chung Hsing University): Ramsey Properties for $V$-shaped Posets in the Boolean Lattices\, 7:00-7:25\nDimitry Zakharov (Moscow Institute of Physics and Technology): Zero subsums in vector spaces over finite fields\, 7:30-7:55\n\nAbstracts (pdf file) \n 
URL:https://dimag.ibs.re.kr/event/2021-10-20/
LOCATION:Zoom ID: 554 788 7710 (507464)
CATEGORIES:Workshops and Conferences
END:VEVENT
END:VCALENDAR