Publication details
A bound on the inducibility of cycles
| Authors | |
|---|---|
| Year of publication | 2019 |
| Type | Article in Periodical |
| Magazine / Source | Journal of Combinatorial Theory, Series A |
| MU Faculty or unit | |
| Citation | |
| web | http://dx.doi.org/10.1016/j.jcta.2018.08.003 |
| Keywords | Extremal graph theory; Inducibility; Cycles |
| Description | In 1975, Pippenger and Golumbic conjectured that every n-vertex graph has at most n(k)/(k(k) - k) induced cycles of length k >= 5. We prove that every n-vertex graph has at most 2n(k)/k(k) induced cycles of length k. (C) 2018 Elsevier Inc. All rights reserved. |