Mathematical Sciences: Cycles and Subdivisions in 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. ***