The 4th Lake Michigan Workshop on Combinatorics and Graph Theory

该奖项为2017年4月15日和16日在西密歇根大学数学系举行的第四届密歇根湖组合学和图论研讨会的参与者提供旅行支持。该研讨会将有利于研究生和离散数学领域的早期职业研究人员，在密歇根湖附近地区的机构工作。它将围绕两套三次的辅导课展开，侧重于演讲者认为在典型的研究生序列中代表性不足的经典技术和结果，以及演讲者特别有资格阐述的新兴技术。还将有一些不太知名的研究人员进行简短的演讲。会议网页在http://homepages.wmich.edu/~zyb1431/workshop2017/.Combinatorics和图论是离散数学中两个非常活跃的研究领域，与统计物理学和网络科学等学科有着重要的联系。在密歇根湖附近，有大量的研究人员和学生在研究各种图论和组合问题。这个讲习班将把许多这样的工人聚集在一起。通过辅导课、简短的谈话、公开问题会议和非正式的合作时间，研讨会将训练初学者学习组合学和图论的重要经典和新兴技术。主讲人将是卡内基梅隆大学的Tom Bohman（他将讲随机贪婪过程中的动态集中）和滑铁卢大学的Penny Haxell（他将讲边着色多图）。

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).