1. PF Insights is off to a great start! Fresh and interesting articles on all things science and math. Here: PF Insights

Regions in complete graph

  1. Say you draw the n'th complete graph in such a way that no three (or more) edges intersect at any one point (other then the vertices). Basically, the graphs are drawn such that they are equally spaced around a circle.

    Always drawn as it shows here http://en.wikipedia.org/wiki/Complete_graph

    How many regions (triangles) are in the Knth complete graph? What is the logic behind this?
     
  2. jcsd
Know someone interested in this topic? Share a link to this question via email, Google+, Twitter, or Facebook

Have something to add?

0
Draft saved Draft deleted