1 paper
Maria Chudnovsky, Ilya Maier
Let G be a graph and let cl(G) be the number of distinct induced cycle lengths in G. We show that for c,t∈N, every graph G that does not contain an in…