Jump to content

Combinatorial principles

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 64.180.224.113 (talk) at 08:16, 29 April 2005. 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