Decorated hub graphs and the number of cycle spectra of graphs
Description
A graph’s cycle spectrum is the set of lengths of its cycles. In this paper, I improve my previous lower bound on the number of distinct cycle spectra of graphs on n vertices from 19.61 × 2^(n/2) to 37.18 × 2^(n/2) for every n ≥ 1024. Most of the improvement comes from attaching short paths to hub graphs and counting the distinct spectra they produce.
This is all related to Erdos Problem 84 (see https://www.erdosproblems.com/84), which asks if f(n)/(2^(n/2)) approaches infinity, where f(n) denotes the number of distinct cycle spectra of graphs on n vertices.. From the research I've done thus far, I would lean that f(n)/(2^(n/2)) is bounded, but only slightly.
If you find anything erroneous / want to contact me my email is eliasbot at usc.edu.