## Combinatorics: An Invitation |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Preliminaries | 1 |

Basic Combinatorics | 99 |

Intermediate Combinatorics | 171 |

Copyright | |

5 other sections not shown

### Common terms and phrases

adjacent affine plane antisymmetric augmenting path balls bijection bipartite graph BUDGET called cardinality choose combinatorial compute consider Corollary cycle defined denote depth-first search determine digraph G directed graph distinct elements end loop equivalence relation eulerian circuit Exercise Set Find the number finite sets formula given graph G graph of order hamiltonian hamiltonian cycle Hasse diagram HCOST Hence identity irreflexive isomorphic Iteration Let G lex order matching mathematical matrix minimum spanning tree nonempty set nonnegative integer Note number of partitions obtain one-to-one ordered partitions orthogonal Latin squares pair permutation planar graph plane of order polynomial positive integer problem projective plane proof Prove rank reachable real numbers recurrence equation reflexive result rooted tree sequence set of G Show shown in Figure Solution squares of order Steiner triple system Suppose symmetric Theorem transitive unique UNIT-COST vertex vertex of G vertices