Mathematical Sciences: Edge Colorings of Graphs

数学科学：图的边缘着色

• 批准号: 9400530
• 负责人: Richard Schelp
• 金额: $ 10.29万
• 依托单位: University of Memphis
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1994
• 资助国家: 美国
• 起止时间: 1994-06-01 至 1997-11-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9400530&HistoricalAwards=false
• 关键词: Mathematical; Sciences; Edge; Colorings; Graphs

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

舍尔普 该奖项资助了Richard Schelp教授在图论方面的工作。 Schelp教授将研究图的特殊边着色及其与Ramsey数或特殊边标号的关系。 特别是，有三个关于边缘着色的猜想，两个是Schelp提出的，一个是Burr和Erdos提出的，Schelp教授将在本项目中研究这些猜想。 该研究是在组合学的一般领域， 特别是图论。组合数学试图找到有效的方法来研究如何组织离散的集合。 图是由线连接的点的排列。 的 像图这样的离散集合的行为 在系统建模中很重要，在现代 计算、通信和操作。 比如说 大型网络的设计，如电话系统，以及计算机科学中的算法设计，都在其 开发，并利用组合研究。***