Combinatorics and graph theory is the science of studying discrete objects. With the rapid
development of computer science, the study of combinatorics and graph theory becomes more and
more important. Besides important applications in computer science; communication; coding and cryptography;
physics; chemistry; and biology, it can be directly applied to enterprise management; transportation;
war command; and financial analysis.
In this talk, we shall focus on classical problems in combinatorics and graph theory
including the four color problem; the seven bridges problem; Hamiltonian cycle problem; the shortest
path problem; Ramsay number; pigeonhole principle; and Fibonacci sequence. We shall introduce their
backgrounds, history, development and applications.