MATH 701 Combinatorial Analysis
This is a graduate course to develop understanding of discrete mathematics through study of combinatorial principles. Topics include: Graphs; Trees; Coloring of graphs and Ramsey theorem; Dilworth’s theorem and extremal set theory; Inclusion-exclusion principle; Recursions and generating functions; Partitions; (0, 1)-Matrices; Hadamard matrices; Reed-Muller codes; Codes and designs; Strongly regular graphs and partial geometries; Projective and combinatorial geometries; Polya theory of counting.