Editing Outline of combinatorics (section)

==General combinatorial principles and methods==
* [[Combinatorial principles]]
* [[Trial and error]], [[brute-force search]], [[bogosort]], [[British Museum algorithm]]
* [[Pigeonhole principle]]
* [[Method of distinguished element]]
* [[Mathematical induction]]
* [[Recurrence relation]], [[telescoping series]]
* [[Generating function]]s as an application of [[formal power series]]
** [[Cyclic sieving]]
** [[Schrödinger method]]
** [[Exponential generating function]]
** [[Stanley's reciprocity theorem]]
* [[Binomial coefficient]]s and their properties
* [[Combinatorial proof]]
** [[Double counting (proof technique)]]
** [[Bijective proof]]
* [[Inclusion–exclusion principle]]
* [[Möbius inversion formula]]
* [[Parity (mathematics)|Parity]], [[even and odd permutations]]
* [[Restricted sumset|Combinatorial Nullstellensatz]]
* [[Incidence algebra]]
* [[Greedy algorithm]]
* [[Divide and conquer algorithm]]
** [[Akra–Bazzi method]]
* [[Dynamic programming]]
* [[Branch and bound]]
* [[Birthday attack]], [[birthday paradox]]
* [[Floyd's cycle-finding algorithm]]
* Reduction to [[linear algebra]]
* [[Sparse matrix|Sparsity]]
* [[Weight function]]
* [[Minimax algorithm]]
** [[Alpha–beta pruning]]
* [[Probabilistic method]]
* [[Sieve theory|Sieve methods]]
* [[Analytic combinatorics]]
* [[Symbolic combinatorics]]
* [[Combinatorial class]]
* [[Exponential formula]] [[Talk:Exponential formula| ]]
* [[Twelvefold way]] [[Talk:Twelvefold way| ]]
* [[MacMahon Master theorem]] [[Talk:MacMahon Master theorem| ]]