Date of Original Version

5-2006

Type

Article

Abstract or Description

Let G be an edge weighted graph with n nodes, and let A(3,G) be the average weight of a triangle in G. We show that the number of triangles with weight at most equal to A(3,G) is at least (n−2) and that this bound is sharp for all n≥7. Extensions of this result to cliques of cardinality k>3 are also discussed.

DOI

10.1016/j.disopt.2006.05.004

Share

COinS
 

Published In

Discrete Optimization, 3, 3, 206-219.