Applications of Discrete Mathematics
Applications of Discrete Mathematics
(See related pages)

This supplement presents a wide variety of interesting and important applications in discrete mathematics, grouped in individual chapters for thorough treatment of each application. Each chapter contains its own set of Examples and Exercises, and are organized so that they can be studied independently of each other. Consult the Preface for more details.

_PREFACE (88.0K)

### PART I — Discrete Structures and Computing

_1_ THE APPORTIONMENT PROBLEM (180.0K)
_2_ FINITE MARKOV CHAINS (202.0K)
_3_ RATIONAL ELECTION PROCEDURES (186.0K)
_4_ G¨ODEL’S UNDECIDABILITY THEOREM (211.0K)
_5_ CODING THEORY (210.0K)

### PART II — Combinatorics

_6_ STIRLING NUMBERS (173.0K)
_7_ CATALAN NUMBERS (437.0K)
_8_ RAMSEY NUMBERS (256.0K)
_9_ ARRANGEMENTS WITH FORBIDDEN POSITIONS (428.0K)
_10_ BLOCK DESIGNS AND LATIN SQUARES (140.0K)
_11_ SCHEDULING PROBLEMS AND BIN PACKING (422.0K)
_12_ BURNSIDE-P ´OLYA COUNTING METHODS (311.0K)

### PART III — Graph Theory

_13_ FOOD WEBS (446.0K)
_14_ APPLICATIONS OF SUBGRAPH ENUMERATION (499.0K)
_15_ TRAVELING SALESMAN PROBLEM (919.0K)
_16_ THE TANTALIZING FOUR CUBES (527.0K)
_17_ THE ASSIGNMENT PROBLEM (419.0K)
_18_ SHORTEST PATH PROBLEMS (237.0K)
_19_ NETWORK SURVIVABILITY (627.0K)
_20_ THE CHINESE POSTMAN PROBLEM (322.0K)
_21_ GRAPH LAYOUTS (639.0K)
_22_ GRAPH MULTICOLORINGS (271.0K)
_23_ NETWORK FLOWS (720.0K)
_24_ PETRI NETS (880.0K)

_SOLUTIONS TO EXERCISES (1777.0K)
_INDEX (54.0K)