On the inducibility of cycles
In 1975 Pippenger and Golumbic proved that any graph on n vertices admits at most 2e(n/k)k induced k-cycles. This bound is larger by a multiplicative factor of 2e than the simple lower bound obtained by a blow-up construction. Pippenger and Golumbic conjectured that the latter lower bound is essenti...
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Journal article |
| Argitaratua: |
Elsevier
2018
|