What do road and railway systems, mingling at parties, mazes, family trees, and the internet all have in common? All are networks — either people or places or things that relate and connect to one another. In this stimulating book, Peter Higgins shows that these phenomena — and many more — all share the same deep mathematical structure.
The mathematics of networks form the basis of many fascinating puzzles and problems, from tic-tac-toe to circular sudoku. Higgins reveals that understanding networks can give us remarkable new insights into many of these puzzles as well as into a wide array of real-world phenomena. Higgins offers new perspectives on such familiar mathematical quandaries as the four-color map and the bridges of Konisberg. He poses the tantalizing question Can you walk through all the doors of the house just once? He also sheds light on the Postman Problem, a puzzle first posed by a Chinese mathematician: what is the most efficient way of delivering your letters, so you get back to your starting point without having traversed any street twice. And he explores the Harem Problem — a generalization of the Marriage Problem — in which we work out how to satisfy all members of a set of men who have expressed a wish for a harem of wives.