## A first course in combinatorial mathematics |

### What people are saying - Write a review

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

### Contents

INTkODUCTION TO BASIC IDEAS | 1 |

SELECTIONS AND BINOMIAL COEFFICIENTS | 8 |

PAIRINGS PROBLEMS | 21 |

Copyright | |

5 other sections not shown

### Other editions - View all

### Common terms and phrases

assignment problem balls base set binomial coefficients binomial theorem block design boundary conditions brackets choosing chosen code words coeff1cient coefficient of xk colour complement configuration consider construction corresponding deduce denote the number digits dimensions distinct representatives edges example exchange property Exercises exist Find the rook finite projective plane forbidden position formula function given graph Hadamard matrix Hall's theorem hence hexagons incidence matrix inclusion-exclusion principle intersect Latin square lattice packing least Leech's lattice MARRIAGE THEOREM matroid networks non-taking rooks number of derangements number of elements number of possible obtained partitions Pascal's triangle permutations places plane of order points positive integer proof of Theorem prove reader recurrence relation required number result rook polynomial row or column sequence set of jobs seven-point plane Show shown Solution special hexad sphere packings Steiner system Suppose symmetric difference Theorem 2.2 total number Verify vertex vertices X)-configuration