A bound on the inducibility of cycles
classification
🧮 math.CO
keywords
cycleseverygraphinducedlengthn-vertexboundconjectured
read the original abstract
In 1975, Pippenger and Golumbic conjectured that every n-vertex graph has at most $n^k/(k^k - k)$ induced cycles of length k for k at least 5. We prove that every n-vertex graph has at most $2 n^k/k^k$ induced cycles of length k.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.