Some Extremal Problems

Basic Counting

Generating Functions

Probabilistic Method

Linear-Algebraic-Methods

The Pigeon Hole Principle

Ramsey Theory

Partially Ordered Sets

Flows in Networks

Combinatorial Games

Polya Theory of Counting

Matroids

Recurrence relation

21-301 Combinatorics Carnegie Mellon University Fall 2021 This course provides a comprehensive introduction to Discrete Mathematics, emphasizing the application of these concepts in Computer Science. Topics include counting, recurrence relations, combinatorial games, Polya theory, and more.  The aim of this course is to introduce the student to some of the most important ideas in Discrete Mathematics. A subsidiary goal is to show how these ideas can be used to solve problems in Computer Science. This course delves into key concepts in Discrete Mathematics and demonstrates their applications in Computer Science problem-solving. The subject matter spans basic counting, recurrence relations, and more advanced topics like combinatorial games and Polya theory of counting. 

21-301 Combinatorics

Mathematical Foundations

Some Extremal Problems

1 courses cover this concept

21-301 Combinatorics