The converse of the Upper Bound Theorem would state that a graph which satisfies the inequality(adsbygoogle = window.adsbygoogle || []).push({});

[tex]e \leq { \frac{n (v-2)}{n-2} [/tex] is planar.

This converse is not true as seen in picture.

Verify that the inequality [tex]e \leq { \frac{n (v-2)}{n-2} [/tex] is true for this graph.

Using the inside-outside algorithm to show that the graph is actually non-planar.

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Upper Bound Theorem

**Physics Forums | Science Articles, Homework Help, Discussion**