MATH 206A

Combinatorial Theory

Description: Generating functions. Probabilistic methods. Polya theorem. Enumerative graph theory. Partition theory. Number theoretical applications. Structure of graphs, matching theory, duality theorems. Packings, pavings, coverings, statistical designs, difference sets, triple systems, finite planes. Configurations, polyhedra. Ramsey theory, finite and transfinite, and applications.

Units: 4.0
1 of 1

Pavel Galashin

Overall Rating N/A
Easiness N/A/ 5
Clarity N/A/ 5
Workload N/A/ 5
Helpfulness N/A/ 5
Most Helpful Review
No reviews have been written yet.

Igor Pak

Overall Rating N/A
Easiness N/A/ 5
Clarity N/A/ 5
Workload N/A/ 5
Helpfulness N/A/ 5
Most Helpful Review
No reviews have been written yet.
AD
1 of 1

Adblock Detected

Bruinwalk is an entirely Daily Bruin-run service brought to you for free. We hate annoying ads just as much as you do, but they help keep our lights on. We promise to keep our ads as relevant for you as possible, so please consider disabling your ad-blocking software while using this site.

Thank you for supporting us!