Register

Recent questions tagged induction

0 votes
1 answer
1
Induction
Prove that the number of edges in a graph with exactly one triangle is at most \begin{align*} \frac{\left( n - 1 \right )^2}{4} + 2 \end{align*}
Prove that the number of edges in a graph with exactly one triangle is at most \begin{align*} \frac{\left( n - 1 \right )^2}{4} + 2\end{align*}
User Avatar
To see more, click for the full list of questions or popular tags.