This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will output the uniqueâ€¦ (More)

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â€¦ (More)