6th Lake Michigan Workshops on Combinatorics and Graph Theory

该奖项支持参加2019年4月6日至7日在西密歇根大学(密歇根州卡拉马祖)数学系举行的第六届密歇根湖组合学和图论研讨会的与会者的旅费。研讨会将使离散数学领域的研究生和初级研究人员受益，他们在密歇根湖周围地区的机构工作。它将围绕两套三个教程讲课，重点放在演讲者认为在典型的研究生课程序列中没有得到充分代表的经典技术和结果，以及演讲者特别有资格阐述的新兴技术。还将有一些年轻教职员工的简短演讲。将保留充足的时间，以便开始新的研究合作，并继续进行积极的合作。初级学员将与更资深的同事建立有价值的联系，并在轻松和非正式的环境中接受他们的指导。组合学和图论是离散数学更广泛领域中两个非常活跃的研究领域，与统计物理和网络科学等学科有着重要的联系。在密歇根湖附近，有大量的研究人员和学生在研究各种图论和组合问题。这次研讨会将把许多这样的人聚集在一起。通过辅导讲座、简短的演讲、开放的问题会议和非正式的合作时间，研讨会将培训初学者学习组合学和图论的重要经典和新兴技术。主讲人是爱荷华州立大学的伯纳德·利迪基(他将就旗代数及其应用发表演讲)和加州大学圣地亚哥分校的雅克·弗斯特雷特(他将就超图展开的极端问题发表演讲)。该奖项反映了NSF的法定使命，并通过使用基金会的智力优势和更广泛的影响审查标准进行评估，被认为值得支持。

This award supports travel for participants in the 6th Lake Michigan Workshop on Combinatorics and Graph Theory, held at the Department of Mathematics at the Western Michigan University (Kalamazoo, MI) on the weekend of April 6-7, 2019. The workshop will benefit graduate students and junior 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 course sequences, and on emerging techniques on which the speakers are particularly qualified to expound. There will also be some short talks by younger faculty members. There will be ample time reserved to allow new research collaborations to commence, and active collaborations to continue. Junior participants will establish valuable connections with more senior colleagues, and receive guidance from them in a relaxed and informal environment.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 people 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 Bernard Lidicky, Iowa State University (who will speak on flag algebras and their applications) and Jacques Verstraete, University of California, San Diego (who will speak on extremal problems for hypergraph expansions).This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.