MS-Tu-D-12
Extremal Combinatorics, Probabilistic Combinatorics, and their applications - Part III of III
For Part I, see MS-Mo-D-12
For Part II, see MS-Mo-E-12
Date: August 11
Time: 13:30--15:30
Room: 208B
(Note: Click title to show the abstract.)
Organizer:
Ma, Jie (Univ. of Sci. & Tech. of China)
Huang, Hao (Inst. for Mathematics & its Applications, Univ. of Minnesota)
Chen, Guantao (Georgia State Univ.)
Abstract: Combinatorics is a fundamental discipline of modern mathematics which studies discrete objects and their properties. This minisymposium we propose will focus on the subfield of extremal and probabilistic combinatorics, which has witnessed an exciting development over the past decades, and also has many striking practical applications in mathematical optimization, computer science, statistical physics and voting society. We aim to bring the top researchers to the minisymposium, where they will present the recent progress, discuss open challenges, exchange research ideas, and initiate new collaborations. We expect a minisymposium of this nature to have a lasting impact on the future of the subject.
MS-Tu-D-12-1
13:30--14:00
A simple removal lemma for large nearly-intersecting families
Das, Shagnik (Freie Universität Berlin)
MS-Tu-D-12-2
14:00--14:30
Circular flow of highly edge connected signed graphs
Zhu, Xuding (Zhejiang Normal Univ.)
MS-Tu-D-12-3
14:30--15:00
Fractional Chromatic number of subgraphs
Wu, Hehui (Univ. of Mississippi)
MS-Tu-D-12-4
15:00--15:30
Computing with voting trees
Iglesias, Jennifer (Carnegie Mellon Univ.)
Ince, Nathaniel (Carnegie Mellon Univ.)
Loh, Po-Shen (Carnegie Mellon Univ.)
Footnote: Code: Type-Date-Time-Room No. Type : IL=Invited Lecture, SL=Special Lectures, MS=Minisymposia, IM=Industrial Minisymposia, CP=Contributed Papers, PP=Posters Date: Mo=Monday, Tu=Tuesday, We=Wednesday, Th=Thursday, Fr=Friday Time : A=8:30-9:30, B=10:00-11:00, C=11:10-12:10, BC=10:00-12:10, D=13:30-15:30, E=16:00-18:00, F=19:00-20:00, G=12:10-13:30, H=15:30-16:00 Room No.: TBA |