Not many neighbors. Show that every map has at least one country (oceans count as countries) with five or fewer neighbors—that is, countries that share a border with it. (Hint: Put a vertex in the center of each country and join two vertices if the two countries share a border. This procedure produces a graph with one vertex for each country. The number of edges emanating from a vertex equals the number of neighboring countries. Suppose each country has six or more neighbors. What’s the smallest number of edges the graph would have? How many faces would there have to he to make the Euler Characteristic hold?)
Want to see the full answer?
Check out a sample textbook solutionChapter 6 Solutions
The Heart of Mathematics: An Invitation to Effective Thinking
Additional Math Textbook Solutions
A Problem Solving Approach To Mathematics For Elementary School Teachers (13th Edition)
Introductory Mathematics for Engineering Applications
Thinking Mathematically (6th Edition)
Using & Understanding Mathematics: A Quantitative Reasoning Approach (7th Edition)
Excursions in Modern Mathematics (9th Edition)
Fundamentals of Differential Equations and Boundary Value Problems
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage