MA3202: Introduction to Combinatorics


  • Text.
    Richard A. Brualdi, Introductory Combinatorics, Fifth Edition, Prentice Hall, 2010.
  • Course Description.
    MA 3210 - Introduction to Combinatorics Topics include set theory, mathematical induction, integers, functions and relations, counting methods, recurrence relations, generating functions, permutations, combinations, principle of inclusion and exclusion, graphs (including planar graphs). Further possible topics are graph coloring, trees and cut-sets, combinatorial designs, Boolean algebra. Pre-Requisite(s): MA 2320 or MA 2321 or MA 2330
  • Syllabus.
    We start with covering Chapters 1 through 6. After the completion of these chapters we will select some more advanced topics from the remaining chapters in the text.
  • Grading
    Your grade will be based home work assignments on 2 or 3 midterm examinations. a final examination.
  • Homework.
    Clearly mark the beginning and end of each problem. Put your name at the beginning of each page. I expect the problems to be well written in full English sentences with no gaps in detail or logic. Please be as elegant and as concise as possible. Cite all references.