Useful Links
Mathematics
Combinatorics
1. Introduction to Combinatorics
2. Fundamental Counting Principles
3. Permutations
4. Combinations
5. The Binomial Theorem
6. Advanced Counting Techniques
7. Recurrence Relations
8. Generating Functions
9. Special Counting Numbers and Sequences
10. Graph Theory and Combinatorics
11. Design Theory
12. Probabilistic Combinatorics
13. Algebraic Combinatorics
14. Extremal Combinatorics
15. Applications and Advanced Topics
Graph Theory and Combinatorics
Basic Graph Enumeration
Counting Labeled Graphs
Counting Unlabeled Graphs
Polya Enumeration Theory
Counting Trees
Definition of Trees
Cayley's Formula for Labeled Trees
Prüfer Sequences
Bijection with Trees
Encoding and Decoding
Counting Unlabeled Trees
Rooted Trees
Binary Trees
Counting Spanning Trees
Definition of Spanning Trees
The Matrix Tree Theorem
Kirchhoff's Theorem
Applications in Network Theory
Graph Coloring
Vertex Coloring
Chromatic Number
Chromatic Polynomials
Definition and Properties
Deletion-Contraction Formula
Examples and Calculations
Edge Coloring
Applications of Graph Coloring
Matchings and Coverings
Perfect Matchings
Counting Matchings
Hall's Marriage Theorem
König's Theorem
Previous
9. Special Counting Numbers and Sequences
Go to top
Next
11. Design Theory