Jump to content

Combinatorial principles

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by ED (talk | contribs) at 05:16, 30 May 2005 (Changed capitalization scheme, added generating function and recurrence relation). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In proving results in combinatorics several useful combinatorial rules or combinatorial principles are used. They include:

  1. Rule of sum
  2. Rule of product
  3. Bijective proof
  4. bookkeeper's rule
  5. Pigeonhole principle
  6. Inclusion-exclusion principle
  7. Method of distinguished element
  8. Generating function
  9. Recurrence relation