Mathematical Sciences: Cycles and Subdivisions in Graphs

WPCH 2 B P Z Courier10cpi 3|x S x 6X@8；X@HP LaserJet IIID-Back HPIIIDB.prs x@，\，j 5{X@2 L V Z Z 3|x Courier 10cpi？X，x 6 X@8；X@HP LaserJet IIID-Back HPIIIDB.PrS x@，\，j 5{X@2 F`F 9301909 Yu该奖项支持于教授从事组合学研究。余教授建议研究图论中的几个基本主题，其中一些对数学科学的其他领域具有理论兴趣，一些具有实际应用。更准确地说，他将研究哈密尔顿圈问题和圈覆盖问题，在给定的图中找到某些类型的子图的问题，这在网络设计中有应用，以及某些平面图的特征问题。这项研究属于组合学的一般领域。组合学试图找到有效的方法来研究如何组织离散的集合。离散系统的行为对于现代通信来说是极其重要的。例如，大型网络的设计，如电话系统，以及计算机科学中的算法设计，都涉及离散对象，这利用了组合研究。***

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