Given a simple directed graph G=(V,E) an induced cycle is a cycle where no two vertices of the cycle have an edge that is not in the cycle. (Chordless cycles are induced cycles with at lease 4 vertices).My question is what is the maximum number of induced cycle a simple directed graph can have? I have looked around the web quite a bit. However I was not able to find an answer to this specific question.
The maximum number of induced cycle in a simple directed graph
algorithms;graph;graph traversal;combinatorics