find a cycle, remove that cycle from the graph, repeat
count the number of removed cycles as a lower bound