Jump to content

Combinatorial principles

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Grutness (talk | contribs) at 00:00, 10 March 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

  1. rule of sum
  2. rule of product
  3. rule of equality (bijective proof)
  4. bookkeper's rule
  5. pigeonhole principle
  6. inclusion-exclusion principle
  7. method of distinguished element

This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Combinatorial_principles&oldid=10978677"