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...
Autori principali: | Hefetz, D, Tyomkyn, M |
---|---|
Natura: | Journal article |
Pubblicazione: |
Elsevier
2018
|
Documenti analoghi
Documenti analoghi
-
On the inducibility of cycles
di: Hefetz, D, et al.
Pubblicazione: (2017) -
Universality of graphs with few triangles and anti-triangles
di: Hefetz, D, et al.
Pubblicazione: (2015) -
Lagrangians of hypergraphs: The Frankl-Füredi conjecture holds almost everywhere
di: Tyomkyn, M
Pubblicazione: (2017) -
Lagrangians of hypergraphs: The Frankl–Füredi conjecture holds almost everywhere
di: Tyomkyn, M
Pubblicazione: (2017) -
Punishment in times of conflict: justifications, rationales and effects
di: Noah Hefetz, R
Pubblicazione: (2023)