Minimising the number of triangular edges
Combinatorics
2016-05-03 v1
Abstract
We consider the problem of minimising the number of edges that are contained in triangles, among -vertex graphs with a given number of edges. We prove a conjecture of F\"uredi and Maleki that gives an exact formula for this minimum, for sufficiently large .
Keywords
Cite
@article{arxiv.1605.00528,
title = {Minimising the number of triangular edges},
author = {Vytautas Gruslys and Shoham Letzter},
journal= {arXiv preprint arXiv:1605.00528},
year = {2016}
}
Comments
43 pages, 8 figures