Nets, Puzzles, and Postmen and over one million other books are available for Amazon Kindle. Learn more


or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Nets, Puzzles and Postmen: An Exploration of Mathematical Connections
 
 
Start reading Nets, Puzzles, and Postmen on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Nets, Puzzles and Postmen: An Exploration of Mathematical Connections [Hardcover]

Peter M Higgins (Author)
5.0 out of 5 stars  See all reviews (1 customer review)

Price: $35.00 & this item ships for FREE with Super Saver Shipping. Details
  Special Offers Available
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Only 2 left in stock--order soon (more on the way).
Want it delivered Monday, January 30? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for Students. Learn more

Formats

Amazon Price New from Used from
Kindle Edition $13.17  
Hardcover $35.00  
Paperback $21.95  

Book Description

0199218420 978-0199218424 February 20, 2008
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.
Only relatively recently have mathematicians begun to explore networks and connections, and their importance has taken everyone by surprise. Nets, Puzzles, and Postmen takes readers on a dazzling tour of this new field, in a book that will delight math buffs everywhere.

Special Offers and Product Promotions

  • Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)

Customers Who Bought This Item Also Bought


Editorial Reviews

Review


"Higgins writes in an invitingly transparent style, allowing nonspecialists to share intellectual adventures previously reserved for scholars."--ooklist


"Recommended [for] general readers; lower- and upper-division undergraduates."--Choice


"Recommended [for] general readers; lower- and upper-division undergraduates."--Choice


"In Nets, Puzzles, and Postmen, Peter Higgins offers a popular account of the mathematics of networks. Readers willing to expose themselves to mathematical reasoning will find themselves rewarded with numerous insight into the structure of networks." -- Science


About the Author


Peter M. Higgins is Professor of Mathematics and Head of Mathematical Sciences at the University of Essex. His previous mathematics books for a popular audience include Mathematics for the Curious, Mathematics for the Imagination, and The Official Book of Circular Sudoku. He is the inventor of Circular Sudoku, which has now appeared throughout the world in magazines, books, the internet, and handheld computer games.

Product Details

  • Hardcover: 288 pages
  • Publisher: Oxford University Press, USA (February 20, 2008)
  • Language: English
  • ISBN-10: 0199218420
  • ISBN-13: 978-0199218424
  • Product Dimensions: 8.5 x 5.7 x 1.1 inches
  • Shipping Weight: 15.5 ounces (View shipping rates and policies)
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #1,335,343 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

 

Customer Reviews

1 Review
5 star:
 (1)
4 star:    (0)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
5.0 out of 5 stars (1 customer review)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

5 of 5 people found the following review helpful:
5.0 out of 5 stars Engaging book on casual graph theory and combinatorial complexity, December 31, 2009
I'm glad to have found this little gem of a book on graph theory at my local bookstore. It is a rather odd book, as it's clearly not a rigourous math or computational theory book, and yet it has enough technical sophistication to put it beyond the reach of understanding for a general audience. It seems more apt for people who are non-mathematicians but who have had some background in graph and complexity theory and would like to read some mathematical diversions written in a casual, colloquial style.

Although the author likes to term the subject of his book as "nets", it is clearly focused on graph theory, with topics covering a wide range of areas, including planarity, colouring, reachability, network flow, shortest path, and automata. There is also an excellent discussion of the pigeonhole principle and the handshaking lemma, both used in many places throughout the book. The author unfortunately does not cover combinatorial subgraph selection (e.g. clique and vertex cover), approximation algorithms, or all-pairs-shortest-path in much detail.

The author's writing style is very engaging and friendly, and it's certainly a nice break from the encyclopedic style found in typical textbooks. The author presents the history of graph theory, including Euler's Konigsberg bridges problem, and discusses a number of complexity problems, including sudoku, amino acid chains, marriage arrangement, and Huffman encoding. Although the book is not mathematically rigourous, the author does provide a nice bibliography, and chapter 10 serves as an appendix that goes into mathematical detail with proofs of several of the concepts presented in earlier chapters.

There are only a few negatives. The problem of lying tribesmen in chapter 1 is unnecessarily tedious as a motivating example on complexity. Furthermore, although the author has sprinkled diagrams throughout the book, there is certainly a need for more given that the book is centered on graphs. The section on network flow definitely would benefit from more illustrations.

In summary, this is an excellent casual book on graph theory and complexity written in an engaging style.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Inside This Book (learn more)
First Sentence:
The importance of networks has taken everyone by surprise. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
marriage lemma, pigeonhole principle, chinese postman problem, subset sum problem, complete enzyme digest, two odd nodes, bipartite network, augmented network, node disjoint paths, plane network, planar network, odd vertices, edge disjoint paths, temporary label
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Sperner's Lemma, Connect Four, World Wide Web, Leonhard Euler, Marriage Problem, Menger's Theorem, Hand-Shaking Lemma, Hall's Lemma, Max Flow Min Cut Theorem, Nearest Neighbour Strategy, Circular Sudoku
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
Search Inside This Book:

Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 
(1)

Your tags: Add your first tag
 

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject