
#1
Feb1209, 09:41 AM

P: 6

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? 


Register to reply 
Related Discussions  
K complete graph  Set Theory, Logic, Probability, Statistics  1  
Degrees of freedom in HII regions  General Astronomy  0  
transistor regions of operation  Engineering, Comp Sci, & Technology Homework  5  
HII Regions  Astrophysics  1  
Number of Regions in a Plane  General Math  5 