Mathematical Sciences: Cycles and Subdivisions in Graphs

WPCH 2 B P Z 快递10 cpi 3| X S X 6 X @ 8 ; X @ HP LaserJet III-返回 HPIIIDB.PRS X @ , \，j 5{X @ 2 L V Z Z 3| X 10cpi ? x x x， X 6 X @ 8 ; X @ HP LaserJet III-返回 HPIIIDB.PRS X @ , \，j 5{X @ 2 F ` F 小行星9301909 该奖项支持余教授在组合学方面的研究。 余教授建议研究图论中的几个基本课题，其中一些在数学科学的其他领域具有理论意义，其中一些具有实际应用。 更确切地说，他将研究的汉密尔顿循环问题和循环覆盖问题，问题的发现某些类型的子图在一个给定的图形，这已应用到网络设计，以及问题的特点，某些平面图。 该研究是在组合学的一般领域。 组合数学试图找到有效的方法来研究如何组织离散的集合。 离散系统的行为对现代通信极为重要。 例如，大型网络的设计，如电话系统，以及计算机科学中算法的设计都涉及离散对象，这就需要使用组合研究。***

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