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

    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?

Draft saved Draft deleted