Yahoo Answers is shutting down on May 4th, 2021 (Eastern Time) and beginning April 20th, 2021 (Eastern Time) the Yahoo Answers website will be in read-only mode. There will be no changes to other Yahoo properties or services, or your Yahoo account. You can find more information about the Yahoo Answers shutdown and how to download your data on this help page.
Trending News
Each edge borders 2 faces, and every face has at least 3 edges -> 2E ≥ 3F?
This is a particular part of a proof that K5 (complete graph of 5 vertices) is not planar. And I don't see how to go from the left side of '->' to the right side. Can anyone explain this?
1 Answer
- jsjsLv 51 decade agoFavorite Answer
Let's try to count the number of edges. Each face has at least 3 edges, so if we count three edges per face we get E ≥ 3F. However, this counts each edge twice, since each edge borders two different faces. Thus we have actually shown that 2E ≥ 3F.