MathDB
Minimum number of edges of complete triangular graphs

Source: Romanian TST 2 2008, Problem 4

June 7, 2008
inductioncombinatorics proposedcombinatorics

Problem Statement

Let G G be a connected graph with n n vertices and m m edges such that each edge is contained in at least one triangle. Find the minimum value of m m.
Back to ProblemsView on AoPS