Difference between revisions of "Combinatorics"
m |
(→Study Guides to Combinatorics) |
||
| Line 5: | Line 5: | ||
*[[Combinatorics/Intermediate]] | *[[Combinatorics/Intermediate]] | ||
*[[Combinatorics/Olympiad]] | *[[Combinatorics/Olympiad]] | ||
| + | |||
| + | |||
| + | |||
| + | |||
| + | [[Combinatorics Challenge Problems]] | ||
Revision as of 23:01, 22 April 2020
Combinatorics is the study of discrete structures in general, and enumeration on discrete structures in particular. For example, the number of three-cycles in a given graph is a combinatoric problem, as is the derivation of a non-recursive formula for the Fibonacci numbers, and so too methods of solving the Rubiks cube. Different kinds of counting problems can be approached by a variety of techniques, such as generating functions or the principle of inclusion-exclusion.
Study Guides to Combinatorics
