1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Combinatorics planar graph dealing with triples

  1. Sep 13, 2008 #1
    A complete tripartite K r,s,t is a generalization of a complete bipartite graph. There are three subsets of vertices, r in teh first subset, s in the second subset, and t in the third subset. Every vertex in one particular subset is adjacent to every vertex in the other two subsets; that is, a vertex is adjacent to all vertices except those in its own subset. Determine all the triples r,s,t for which K r,s,t is planar.


    I am thinking that there must be a minium of 12 vertices....But I am not sure...



    . .
    . .
    . .
    . . Maybe two side by side and one underneath? I am not sure

    . . . .
     
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you help with the solution or looking for help too?



Similar Discussions: Combinatorics planar graph dealing with triples
  1. Triple Integration (Replies: 0)

  2. Graph Theory Problem (Replies: 0)

  3. Graph Theory (Replies: 0)

Loading...