Combinatorial principles
From Wikipedia, the free encyclopedia
In proving results in combinatorics several useful combinatorial rules or combinatorial principles are used. They include:
- Rule of sum
- Rule of product
- Bijective proof
- Double counting (proof technique)
- Pigeonhole principle
- Inclusion-exclusion principle
- Method of distinguished element
- Generating function
- Recurrence relation
