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
3
Graph Theory
ΒΆ
Graphs, and everything you can compute for them.
3.1
Construction and Basic Properties
3.2
Eulerian and Hamiltonian Graphs
3.3
Trees
3.4
Planarity
3.5
Coloring
login