Gareth Bendall, François Margot. Minimum number of below average triangles in a weighted complete graph. Discrete Optimization, 3(3):206-219, 2006. [doi]
@article{BendallM06,
title = {Minimum number of below average triangles in a weighted complete graph},
author = {Gareth Bendall and François Margot},
year = {2006},
doi = {10.1016/j.disopt.2006.05.004},
url = {http://dx.doi.org/10.1016/j.disopt.2006.05.004},
tags = {completeness, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BendallM06},
cites = {0},
citedby = {0},
journal = {Discrete Optimization},
volume = {3},
number = {3},
pages = {206-219},
}