Overview
Description
Ramsey Theory, Extremal Combinatorics, Partial Orders, Combinatorial Designs; Probabilistic Method, Linear Algebraic and Polynomial Method, Geometric and Topological Method.
Requirements
Prerequisites
- Instructor’s Approval
MATH 485MATH 685
Original catalog text
Prerequisites
MATH 485 or MATH 685 or Instructor’s Approval
Units
Lecture3
Catalog Details
Offering
Offered: Every Spring - Odd Years
Terms
spring
Attributes
Standard
Learning Outcomes
- demonstrate understanding of Ramsey-theoretic arguments and also come up with new Ramsey-type problems in their fields on interest.
- demonstrate understanding of the nature and tools of Extremal problems in Combinatorics as well as come up with new extremal problems while dealing with mathematical structures in their fields of interest.
- demonstrate a deeper understanding of richer structures like that of Posets and Designs and generalize other problems to the setting of these richer structures.
- understand and apply various modern techniques like, Probabilistic, Algebraic and Topological techniques while working with problems in Discrete Math and/or their respective fields of interest.
- import modern tools from other areas of Mathematics and apply it in Discrete Math problems.