Minimizing the number of 5- cycles in graphs with given edge-density.Combinatorics, Probability and Computing, 29(1):44–67, 2019

Patrick Bennett, Andrzej Dudek, Bernard Lidick´ y, Oleg Pikhurko · 2019 · DOI 10.1017/s0963548319000257

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

math.CO · 2026-05-14 · unverdicted · novelty 7.0

I_{K_{2,2,1}}(e) has at least two local maxima in (0,1) and I_{K_t^-}(e) has a non-global local maximum for t in {5,8,11,...,74}.

Showing 1 of 1 citing paper.

Local maximum of inducibility profiles math.CO · 2026-05-14 · unverdicted · none · ref 2
I_{K_{2,2,1}}(e) has at least two local maxima in (0,1) and I_{K_t^-}(e) has a non-global local maximum for t in {5,8,11,...,74}.