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üredi and Maleki that gives an exact formula for this minimum, for sufficiently large .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.