Mathematical Sciences: Cycles and Subdivisions in Graphs

数学科学：图中的循环和细分

• 批准号: 9301909
• 负责人: Xingxing Yu
• 金额: $ 6万
• 依托单位: Georgia Tech Research Corporation
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1993
• 资助国家: 美国
• 起止时间: 1993-07-15 至 1996-12-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9301909&HistoricalAwards=false
• 关键词: Mathematical; Sciences; Cycles; Subdivisions; Graphs

WPCH 2 B P Z Courier 10cpi 3| x s x 6 X @ 8 ; X @ HP LaserJet IIID - BACK HPIIIDB.PRS x @ , \ , j 5{X @ 2 L V Z Z 3| x Courier 10cpi ? x x x , x 6 X @ 8 ; X @ HP LaserJet IIID - BACK HPIIIDB.PRS x @ , \ , j 5{X @ 2 F ` F 9301909 Yu This award supports the research of Professor Yu to work in combinatorics. Professor Yu proposes to study several fundamental topics in graph theory, some of which have theoretical interest in other areas of mathematical sciences and some of which have practical applications. More precisely, he will study the Hamilton cycle problem and cycle cover problems, the problem of finding certain types of subgraphs in a given graph, which has applications to network designs, and the problem of characterizing certain planar graphs. The research is in the general area of combinatorics. Combinatorics attempts to find efficient methods to study how discrete collections can be organized. The behavior of discrete systems is extremely important to modern communications. For example, the design of large networks, as in telephone systems, and the design of algorithms in computer science all deal with discrete objects, and this makes use of combinatorial research. ***

WPCH 2 B P Z Courier 10CPI 3 | X S x 6 x @ 8; x @ hp laserjet iiid- back hpiiidb.prs x @，\，j 5 {x @ 2 l v z z z 3 | X Courier 10cpi？ x x x，x 6 x @ 8; x @ hp laserjet iiid -back hpiiidb.prs x @，\，j 5 {x @ 2 f f`f 9301909 yu这个奖项支持Yu教授的研究以在Combinatorics中工作。 Yu教授建议研究图理论中的几个基本主题，其中一些主题在其他数学科学领域具有理论上的兴趣，其中一些具有实际应用。 更确切地说，他将研究汉密尔顿周期问题和周期问题，即在给定图中找到某些类型的子图的问题，该问题在网络设计中有应用，以及表征某些平面图的问题。 该研究是在组合学的一般领域。 组合学试图找到有效的方法来研究如何组织离散收集。 离散系统的行为对于现代通信非常重要。 例如，大型网络的设计，如电话系统中，计算机科学中的算法设计都涉及离散的对象，这利用了组合研究。 ***