A triangle is a simple undirected graph on three vertices withthree edges connecting these vertices. The triangle problem isdefined as follows:

Input: A simple undirected graph G.

Question: Does G contain a triangle as a subgraph? Is thisproblem in P? Yes, no, unknown? Justify your answer (if your answeris “yes”, briefly describe a polynomial-time algorithm).

## Expert Answer

Answer to A triangle is a simple undirected graph on three vertices with three edges connecting these vertices. The triangle probl…