An induced cycle is a cycle that is an induced subgraph of G; induced cycles are also called chordless cycles or (when the length of the cycle is four or more) holes.

Can anyone please tell me what is the maximum number of holes that a simple graph on n vertices can have?

How to prove a polynomial upper-bound (i.e. $O(n^k)$ for some fixed $k$) for that?