Ramsey theory is a branch of combinatorics that studies the appearance of order in substructures. It focuses on questions about the size of structures needed to guarantee certain properties. It was named after British mathematician and philosopher Frank P. Ramsey.
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.
No concepts data
+ 13 more concepts