Every edge in a triangle

For $n \geq 3$, determine the minimum number of edges in a connected $n$-vertex graph in which every edge belongs to a triangle.

Source: from book "Introduction to Graph Theory"

0

0

0

0

0

0

0

0

0

0