Article contents
Minimizing the Number of Triangular Edges
Published online by Cambridge University Press: 14 August 2017
Abstract
We consider the problem of minimizing the number of edges that are contained in triangles, among n-vertex graphs with a given number of edges. For sufficiently large n, we prove an exact formula for this minimum, which partially resolves a conjecture of Füredi and Maleki.
MSC classification
- Type
- Paper
- Information
- Combinatorics, Probability and Computing , Volume 27 , Special Issue 4: Special Issue: Oberwolfach Workshop , July 2018 , pp. 580 - 622
- Copyright
- Copyright © Cambridge University Press 2017
References
- 1
- Cited by