## Applied CombinatoricsThis text presents techniques and applications of combinatorics. |

### What people are saying - Write a review

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

### Contents

What is Combinatorics? | 1 |

References for Chapter 1 | 11 |

Additional Exercises for Chapter 2 | 71 |

Copyright | |

14 other sections not shown

### Other editions - View all

### Common terms and phrases

algorithm applications assignment augmenting chain binary bipartite graph bit strings cells Chapter chromatic polynomial closed chain codewords coefficient color combinatorics compute consider Corollary corresponding count the number defined depth-first search digits digraph directed network distinguishable edges of G elements encode entry Equation equivalence classes errors eulerian closed eulerian path exactly Example EXERCISES FOR SECTION find the number finite flow given gives graph G graph of Figure graph theory Hadamard matrix hamiltonian circuit hamiltonian path Hence incidence matrix integer labeled least matching Mathematics maximum minimum spanning tree multigraph Note number of distinct number of vertices obtained ordinary generating function orthogonal family pair path permutation players points possible probability problem projective plane proof of Theorem recurrence Repeat Exercise result RNA chain sequence Show solution Steiner triple system Step strings of length strongly connected subgraph subsets Suppose that G switching functions vertex weight