Research in Combinatorics

组合学研究

• 批准号: 9704114
• 负责人: Vojtech Rodl
• 金额: $ 8.03万
• 依托单位: Emory University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1997
• 资助国家: 美国
• 起止时间: 1997-07-01 至 2000-06-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9704114&HistoricalAwards=false
• 关键词: Research; Combinatorics

Rodl 9704114 This award provides funds for an investigation into some research topics in three areas of discrete mathematics - Extremal Combinatorics, Ramsey Theory and Probabilistic Methods. Extremal combinatorics is an important part of combinatorial mathematics. For example a typical problem in graph theory is as follows: given a graph F determine the maximum number ex (n,F) of edges in a graph of order n not containing F. Ramsey theory investigates structures that are preserved under restricted partitions. Naturally, the classical example is the theorem of Ramsey that, in its simplest form, tells us that arbitrarily large 2-edge-colored complete graphs must contain arbitrarily large monochromatic complete subgraphs. Here the partition is given by the coloring and the structures that are preserved under this partition are the complete graphs. Probabilistic Methods have proved to be a powerful technique in combinatorics, and the theory of random graphs is a branch of graph theory that has emerged from these methods. Over the last three years, the proposer's research was mainly concentrated within these areas. The work in this project will include some problems in Ramsey theory, problems involved with possible extensions of the regularity lemma, extremal properties of random graphs, problems on delta systems and others. This research is in the area of combinatorics. One of the goals of combinatorics is to find efficient methods of studying how discrete collections of objects can be arranged. The behavior of discrete systems is extremely important to modern communications. For example, the design of large networks, such as those occurring in telephone systems, and the design of algorithms in computer science deal with discrete sets of objects, and this makes use of combinatorial research.

Rodl 9704114 该奖项为离散数学三个领域的一些研究课题提供资金-极值组合学，拉姆齐理论和概率方法。极值组合数学是组合数学的重要组成部分。 例如，图论中的一个典型问题如下：给定一个图F，确定一个不包含F的n阶图中的最大边数ex（n，F）。 拉姆齐理论研究的是在限制性划分下保持不变的结构。当然，经典的例子是拉姆齐定理，在其最简单的形式，告诉我们，任意大的2-边着色完全图必须包含任意大的单色完全子图。 这里的划分由着色给出，并且在此划分下保留的结构是完全图。 概率方法已被证明是组合学中的一种强有力的技术，随机图理论是从这些方法中产生的图论的一个分支。 在过去三年中，提案人的研究主要集中在这些领域。在这个项目中的工作将包括拉姆齐理论中的一些问题，涉及的问题与可能的扩展的正则引理，极值性质的随机图，问题的三角洲系统和其他人。 这项研究属于组合学领域。组合数学的目标之一是找到有效的方法来研究如何安排离散的对象集合。离散系统的行为对现代通信极为重要。例如，大型网络的设计，如电话系统中的网络设计，以及计算机科学中的算法设计，都要处理离散的对象集，这就需要使用组合研究。