The 4th Lake Michigan Workshop on Combinatorics and Graph Theory

该奖项支持参加2017年4月15日和16日周末在西密歇根大学数学系举行的第四届密歇根湖组合学和图论研讨会的与会者的旅费。研讨会将使离散数学领域的研究生和早期研究人员受益，他们在密歇根湖周围地区的机构工作。它将围绕两套三个教程讲课，重点放在演讲者认为在典型的研究生序列中没有得到充分代表的经典技术和结果，以及演讲者特别有资格阐述的新兴技术。不太知名的研究人员也会做一些简短的演讲。在http://homepages.wmich.edu/~zyb1431/workshop2017/.Combinatorics上维护一个会议网页和图论是离散数学更广泛领域中两个非常活跃的研究领域，与统计物理和网络科学等学科有重要联系。在密歇根湖附近，有大量的研究人员和学生在研究各种图论和组合问题。这个研讨会将把许多这样的工人聚集在一起。通过辅导讲座、简短的演讲、开放的问题会议和非正式的合作时间，研讨会将培训初学者学习组合学和图论的重要经典和新兴技术。讲座讲者将是卡内基梅隆大学的汤姆·博曼(他将就随机贪婪过程中的动态集中发表演讲)和滑铁卢大学的彭妮·哈克塞尔(他将就边着色多重图发表演讲)。

This award supports travel for participants in the 4th Lake Michigan Workshop on Combinatorics and Graph Theory, held at the Department of Mathematics at the Western Michigan University on the weekend of April 15 and 16, 2017. The workshop will benefit graduate students and early-career researchers in the field of discrete mathematics, working at institutions in the area around Lake Michigan. It will be built around two sets of three tutorial lectures, focusing on classical techniques and results that the speakers feel are under-represented in typical graduate sequences, and on emerging techniques on which the speakers are particularly qualified to expound. There will also be some short talks by less established researchers. A conference web page is maintained at http://homepages.wmich.edu/~zyb1431/workshop2017/.Combinatorics and Graph Theory are two very active areas of research within the broader field of Discrete Mathematics, with important ties to disciplines such as statistical physics and network science. In the immediate vicinity of Lake Michigan there are a large number of researchers and students working on a variety of graph theoretical and combinatorial problems. This workshop will bring many of these workers together. Through tutorial lectures, short talks, an open problem session, and informal collaboration time, the workshop will train beginning researchers in important classical and emerging techniques of Combinatorics and Graph Theory. The tutorial speakers will be Tom Bohman, Carnegie Mellon University (who will speak on dynamic concentration in random greedy processes) and Penny Haxell, University of Waterloo (who will speak on edge coloring multigraphs).