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...

ver descrição completa

Detalhes bibliográficos
Main Authors: Hefetz, D, Tyomkyn, M
Formato: Journal article
Publicado em: Elsevier 2018
Search Result 1

On the inducibility of cycles Por Hefetz, D, Tyomkyn, M

Publicado em 2017
Journal article