A bound on the inducibility of cycles
Abstract
In 1975, Pippenger and Golumbic conjectured that every n-vertex graph has at most nk/(kk - k) induced cycles of length k for k at least 5. We prove that every n-vertex graph has at most 2 nk/kk induced cycles of length k.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.