Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

combinatorics

Bijective proof as a technique

taught

Taught in

Bijective proof as a technique
Discrete Mathematics II — Combinatorics

Requires

counting-by-bijection required
what-a-combinatorial-proof-requires required

Required by

A bijective flavor of Cayley's formula required
A partition identity proved bijectively required
Building a bijection between two counted sets required

Local knowledge map

Local knowledge map

Click to expand

Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.