Combinatorics is one of the oldest branches of mathematics. It has been influenced by almost all areas of mathematics, including number theory, algebra, topology, mathematical logic, and many more. In recent years, stimulated by the development of computer science, combinatorics has found new applications in algorithm analysis, network designs, and so on. Now it is one of the fastest growing areas in mathematics. The research of the LSU combinatorics group focuses on the study of graphs, matroids, and hyperplane arrangements.
The origin of graph theory can be traced back to Euler when he studied the Königsberg bridges problem in 1736. However, the development of graph theory as a separate subject occurred predominantly in the twentieth century. In the last twenty years, the study of graph structures has attracted more and more researchers. In this study, the objective is to decompose a large graph into small pieces according to certain very specific rules. Results of this study often have a wide range of applications in computer science and operations research. Several members of the LSU Combinatorics group are currently working in this area.