Mathematical Sciences: Edge Colorings of Graphs

该奖项为理查德·谢尔普教授在图论方面的工作提供了资金。Schelp教授将研究图的特殊边染色及其与Ramsey数或特殊边标号的关系。特别是，有三个猜想，两个源于谢尔普，一个来自伯尔和鄂尔多斯，关于边色，谢尔普教授将在这个项目中研究。这项研究是在组合学的一般领域，特别是图论。组合学试图找到有效的方法来研究如何组织离散的集合。图形是由直线连接的点的排列。像图这样的离散集合的行为在系统建模中非常重要，并在现代计算、通信和操作中发挥着作用。例如，大型网络的设计，如电话系统，以及计算机科学中的算法设计，都在它们的开发中使用图形，并利用组合研究。***

Schelp This award funds the work of Prof. Richard Schelp in graph theory. Prof. Schelp will study special edge colorings of graphs and their connections to Ramsey numbers or special edge labelings. In particular there are three conjectures, two due to Schelp and one to Burr and Erdos about edge colorings that Prof. Schelp will study in this project. The research is in the general area of combinatorics, in particular graph theory. Combinatorics attempts to find efficient methods to study how discrete collections can be organized. Graphs are arrangements of points connected by lines. The behavior of discrete collections like graphs is extremely important in modeling systems and plays a role in modern computing, communications and operations. For example, the design of large networks, as in telephone systems, and the design of algorithms in computer science all use graphs in their development, and make use of combinatorial research. ***