# Combinatorics

"There is no problem in all mathematics that cannot be solved by direct counting."-Ernst Mach

**Combinatorics** is a branch of pure mathematics concerning the study of discrete (and usually finite) objects. It is related to many other areas of mathematics, such as algebra, probability theory, ergodic theory and geometry, as well as to applied subjects in computer science and statistical physics. Aspects of combinatorics include "counting" the objects satisfying certain criteria (enumerative combinatorics), deciding when the criteria can be met, and constructing and analyzing objects meeting the criteria, finding "largest", "smallest", or "optimal" objects (as in combinatorial designs, extremal combinatorics and combinatorial optimization), and finding algebraic structures these objects may have (algebraic combinatorics).

### Developed resources[edit | edit source]

**Combinatorics/Rule of product**counts what might be called "decisions". It is still under construction, but quite developed.

**Combinatorics/Binomial coefficients**introduces binomial coefficients using a tree diagram that recovers Pascal's triangle. A number of advanced topics are then discussed, including Catalan numbers, and Lattice paths

### Undeveloped resources[edit | edit source]

The following resources are undeveloped; some are little more than stubs:

- Combinatorics/About this resource is currently a stub that contains comments that compare the various wikis.
- Combinatorics/Graph & Ramsey Theory
- Combinatorics/Structural Algebra (truly a stub)