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...
Main Authors: | Hefetz, D, Tyomkyn, M |
---|---|
Format: | Journal article |
Udgivet: |
Elsevier
2018
|
Lignende værker
-
On the inducibility of cycles
af: Hefetz, D, et al.
Udgivet: (2017) -
Universality of graphs with few triangles and anti-triangles
af: Hefetz, D, et al.
Udgivet: (2015) -
Lagrangians of hypergraphs: The Frankl-Füredi conjecture holds almost everywhere
af: Tyomkyn, M
Udgivet: (2017) -
Lagrangians of hypergraphs: The Frankl–Füredi conjecture holds almost everywhere
af: Tyomkyn, M
Udgivet: (2017) -
Punishment in times of conflict: justifications, rationales and effects
af: Noah Hefetz, R
Udgivet: (2023)