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