1.Previous
3.Next

as combinatorics, graph theory, and number theory.

The most classical examples of bijective proofs in combinatorics include:
* Prüfer sequence, giving a proof of Cayley's formula for the number of labeled trees.
* Robinson-Schensted algorithm,

1.Previous
3.Next