Informace o publikaci
A bound on the inducibility of cycles
| Autoři | |
|---|---|
| Rok publikování | 2019 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | Journal of Combinatorial Theory, Series A |
| Fakulta / Pracoviště MU | |
| Citace | |
| www | http://dx.doi.org/10.1016/j.jcta.2018.08.003 |
| Klíčová slova | Extremal graph theory; Inducibility; Cycles |
| Popis | 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. |