Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more ➡
Standard view
Full view
of .
×

Introduction and basic concepts
1.1 An assortment of problems
1.2 Numbers and sets: notation
1.3 Mathematical induction and other proofs
1.4 Functions
1.5 Relations
Orderings
2.1 Orderings and how they can be depicted
2.2 Orderings and linear orderings
2.3 Ordering by inclusion
2.4 Large implies tall or wide
Combinatorial counting
3.1 Functions and subsets
3.2 Permutations and factorials
3.3 Binomial coeﬃcients
3.5 Estimates: the factorial function
3.6 Estimates: binomial coeﬃcients
3.7 Inclusion–exclusion principle
3.8 The hatcheck lady & co
Graphs: an introduction
4.1 The notion of a graph; isomorphism
4.3 Graph score
4.4 Eulerian graphs
4.5 Eulerian directed graphs
4.6 2-connectivity
5.1 Deﬁnition and characterizations of trees
5.2 Isomorphism of trees
5.3 Spanning trees of a graph
5.4 The minimum spanning tree problem
5.5 Jarn´ık’s algorithm and Bor˚uvka’s algorithm
6.1 Drawing in the plane and on other surfaces
6.2 Cycles in planar graphs
6.3 Euler’s formula
6.4 Coloring maps: the four-color problem
Double-counting
7.1 Parity arguments
7.2 Sperner’s theorem on independent systems
7.3 An extremal problem: forbidden four-cycles
The number of spanning trees
8.1 The result
8.2 A proof via score
8.3 A proof with vertebrates
8.4 A proof using the Pr¨ufer code
8.5 Proofs working with determinants
8.6 The simplest proof?
Finite projective planes
9.1 Deﬁnition and basic properties
9.2 Existence of ﬁnite projective planes
9.3 Orthogonal Latin squares
10.1 Proofs by counting
10.2 Finite probability spaces
10.3 Random variables and their expectation
10.4 Several applications
Order from disorder: Ramsey’s theorem
11.1 A party of six
11.2 Ramsey’s theorem for graphs
11.3 A lower bound for the Ramsey numbers
Generating functions
12.1 Combinatorial applications of polynomials
12.2 Calculation with power series
12.3 Fibonacci numbers and the golden section
12.4 Binary trees
12.5 On rolling the dice
12.6 Random walk
12.7 Integer partitions
Applications of linear algebra
13.1 Block designs
13.2 Fisher’s inequality
13.3 Covering by complete bipartite graphs
13.4 Cycle space of a graph
13.5 Circulations and cuts: cycle space revisited
13.6 Probabilistic checking
Appendix: Prerequisites from algebra
Bibliography
Hints to selected exercises
Index
0 of .
Results for:
P. 1
Invitation to Discrete Mathematics 2nd

# Invitation to Discrete Mathematics 2nd

Ratings: (0)|Views: 358|Likes:
Invitation to Discrete Mathematics 2nd
Invitation to Discrete Mathematics 2nd

### Availability:

See More
See less

08/14/2013

pdf

text

original

Pages 10 to 95 are not shown in this preview.
Pages 105 to 162 are not shown in this preview.
Pages 172 to 194 are not shown in this preview.
Pages 204 to 298 are not shown in this preview.
Pages 308 to 461 are not shown in this preview.

## Activity (7)

### Showing

AllMost RecentReviewsAll NotesLikes