Discrete Mathematics

Graduate / Professional

Basic concepts and results in discrete mathematics: graphs, trees, connectivity, Ramsey theorem, enumeration, binomial coefficients, Stirling numbers. Properties of finite set systems. Prerequisite: MATH 1150 or equivalent. Some prior exposure to proofs is recommended (ex. MATH 2250 ). QR HTBA