Bounding the number of circuits of a graph (Q2563510)

Let \(c(G)\) be the number of circuits in a graph \(G\). A minor-closed class \(\Omega\) of graphs is called a poly-class if there exists a polynomial function \(p\) so that \(c(G)\leq p(|E(G) |)\) for every graph from \(\Omega\). It is shown that there is a simple characterization of poly-classes by means of forbidden families of graphs.