title: In an undirected graph, the simplest cycle must have 3 nodes?
body: <p>I am trying to write a proof about cycles and undirected graphs but I am confused by something.</p>
  
  <p>If my graph has only 2 vertices and one edge connecting them, that is not a cycle, is it?</p>
  
  <p>So I need at least 3 vertices with 2 connections from 2 vertices to one of the nodes and one between the other two to have the minimum possible cycle (a tringle) in a graph. Or am I approaching it wrong? </p>