Results 1 to 2 of 2

Math Help - Planar Graph problem

  1. #1
    Super Member
    Joined
    Mar 2006
    Posts
    705
    Thanks
    2

    Planar Graph problem

    Let G be a connected planar graph with all circuits of length of at least k.

    Prove that the inequality e <= 3v - 6 with e = number of edge and v = number of vertex can be expanded into e <= (k/k-2)(v-2)
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Opalg's Avatar
    Joined
    Aug 2007
    From
    Leeds, UK
    Posts
    4,041
    Thanks
    7
    Hint: look up the proof of the inequality e \leqslant 3v - 6. All it needs is a slight adaptation to the case where each face of the graph has at least k edges.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 5
    Last Post: December 22nd 2010, 02:42 AM
  2. Planar graph
    Posted in the Discrete Math Forum
    Replies: 7
    Last Post: July 24th 2010, 08:21 AM
  3. Graph Theory Question - Planar
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: May 13th 2010, 10:19 AM
  4. is this graph planar?
    Posted in the Differential Geometry Forum
    Replies: 2
    Last Post: March 3rd 2010, 02:32 PM
  5. isomorphic graph, planar graph
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: May 9th 2009, 09:13 AM

Search Tags


/mathhelpforum @mathhelpforum