Skip to main content
\(\newcommand{\ord}[1]{\left|#1\right|} \newcommand{\set}[1]{\left\lbrace#1\right\rbrace} \newcommand{\binomial}[2]{\binom{#1}{#2}} \newcommand{\multinomial}[2]{\binom{#1}{#2}} \newcommand{\lt}{<} \newcommand{\gt}{>} \newcommand{\amp}{&} \)
Combinatorial Sage
Robert A. Beezer
Contents
Prev
Up
Next
Annotations
Contents
Prev
Up
Next
Front Matter
Preface
1
Basic Counting
Multiplication Principle
Permutations
Combinations
Ordered Partitions
Set Partitions
Integer Partitions
The Birthday Problem
2
Advanced Counting
Recurrence Relations
Generating Functions
3
Graph Theory
Construction and Basic Properties
Eulerian and Hamiltonian Graphs
Trees
Planarity
Coloring
4
Block Designs
Construction and Basic Properties
Authored in PreTeXt
Chapter
1
Basic Counting
ΒΆ
Combination, permutations, with repetition, without repetition, etc.
1.1
Multiplication Principle
1.2
Permutations
1.3
Combinations
1.4
Ordered Partitions
1.5
Set Partitions
1.6
Integer Partitions
1.7
The Birthday Problem
login