Results 1 to 4 of 4

Math Help - Upper Bound Theorem

  1. #1
    Senior Member
    Joined
    Apr 2006
    Posts
    290

    Upper Bound Theorem

    The converse of the Upper Bound Theorem would state that a graph which satisfies the inequality e \leq  { \frac{n (v-2)}{n-2} is planar.

    This converse is not true as seen in picture.

    Verify that the inequality e \leq  { \frac{n (v-2)}{n-2} is true for this graph. Once done, use the inside-outside algorithm to show that the graph is actually non-planar.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member
    Joined
    Apr 2006
    Posts
    290
    e = edges
    v = vertices

    but what is n?
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Mar 2006
    Posts
    7
    perhaps it stand for number of points.
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Senior Member
    Joined
    Apr 2006
    Posts
    290
    could someone work out the inside outside algorithm? I'm stuck
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Squeeze Theorem (can't find upper bound)
    Posted in the Calculus Forum
    Replies: 2
    Last Post: February 26th 2010, 02:49 AM
  2. Replies: 0
    Last Post: February 19th 2010, 01:06 AM
  3. greatest least bound and least upper bound proof
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: November 4th 2009, 04:44 PM
  4. Upper bound/Lower bound?
    Posted in the Pre-Calculus Forum
    Replies: 7
    Last Post: September 13th 2009, 10:48 AM
  5. least upper bound and greatest lower bound
    Posted in the Calculus Forum
    Replies: 2
    Last Post: September 22nd 2007, 09:59 AM

Search Tags


/mathhelpforum @mathhelpforum