Mathematical Sciences: Problems in Combinatorics

数学科学：组合数学问题

• 批准号: 9401559
• 负责人: Vojtech Rodl
• 金额: $ 13.93万
• 依托单位: Emory University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1994
• 资助国家: 美国
• 起止时间: 1994-06-01 至 1998-05-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9401559&HistoricalAwards=false
• 关键词: Mathematical; Sciences; Problems; Combinatorics

Rodl This award funds the research of Professor Vojtech Rodl in extremal graph theory and Ramsey Theory. Prof. Rodl will apply probabilistic methods to problems in random graphs and set systems. These include questions on matching in graphs and hypergraphs. The research is in the general area of combinatorics. Combinatorics attempts to find efficient methods to study how discrete collections can be organized. It turns out that some kinds of structure are unavoidable, and Ramsey Theory studies these basic properties of all collections. The behavior of discrete collections is extremely important in modeling communication systems and plays a role in modern computing, communications and operations. ***

该奖项资助Vojtech Rodl教授在极值图论和拉姆齐理论方面的研究。罗德尔教授将运用概率方法解决随机图和集合系统中的问题。这些问题包括图和超图中的匹配问题。这项研究是在组合学的一般领域。组合学试图找到有效的方法来研究如何组织离散集合。事实证明，某些结构是不可避免的，拉姆齐理论研究的是所有集合的这些基本性质。离散集合的行为在通信系统建模中具有极其重要的意义，在现代计算、通信和操作中发挥着重要作用。＊＊＊