Possible Duplicate:
Maximum number of distinct 3-cliques in a complete graph
What is the number of disjoint edge triangles in a complete graph. For example, if I have a complete graph on 4 vertices, the number of disjoint edge triangles is 2. How do I extend this to a complete graph of n vertices? every edge is in exactly one triangle.