Difference between revisions of "Combinatorics"
(→See also) |
(→Books) |
||
| Line 3: | Line 3: | ||
== Resources == | == Resources == | ||
Listed below are various combinatorics resources including books, classes, and websites. | Listed below are various combinatorics resources including books, classes, and websites. | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
Revision as of 20:35, 8 February 2016
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.
Resources
Listed below are various combinatorics resources including books, classes, and websites.
