Pith. sign in

REVIEW 3 major objections 5 minor 30 references

Forcing Graphs to be Forcing

T0 review · 3 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The box product of any Sidorenko graph with an edge is forcing, so cubes are forcing.

desk verdict New forcing results and a promising algebraic framework, but the main theorems omit the necessary e(G)>0 hypothesis and are false as stated. read the letter →

arxiv 2412.12904 v1 pith:PC5USJHE submitted 2024-12-17 math.CO

Aldo Kiem , Olaf Parczyk , Christoph Spiegel This is my paper · ORCID
classification math.CO MSC 05C3505C6505C80
keywords Sidorenkoconjectureforcingquasi-randomgraphsflagalgebrasgraphhomomorphismdensitiesblow-upssubdivisionsboxproduct
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Sidorenko's conjecture says that, among graphs of a given edge density, the binomial random graph asymptotically minimizes the number of copies of any fixed bipartite graph; a graph is called Sidorenko when this inequality holds for it. The forcing conjecture strengthens this by demanding that any sequence of graphs achieving the minimum be quasi-random, and this paper proves new cases of that stronger statement. Its transfer argument shows that balanced blow-ups of a Sidorenko graph, subdivisions of a Sidorenko graph by a symmetric Sidorenko gadget, and the box product $G \square K_2$ inherit Sidorenko's property; the blow-ups and subdivisions are forcing when the inserted gadget is forcing, and the box product is forcing outright. The headline new example is the cube: cubes were known to be Sidorenko, and the theorem upgrades them to forcing. The same algebra also produces new forcing pairs and new Sidorenko hypergraphs, so the method converts a handful of known forcing graphs into large families of them.

What carries the argument

The load-bearing object is an order-preserving linear operator $\llbracket \cdot \rrbracket_{(\eta,\tau)}$ between graph algebras, assembled from a downward functor $\eta$ on finite sets and an $\eta$-upward transformation $\tau$ that rebuilds a graph from the pieces selected by $\eta$; these generalize the flag-algebra upward and downward operators and include new higher-degree examples that are multiplicative and therefore preserve quasi-randomness. A 'dump label' construction keeps isolated vertices from being erased by the quotient that identifies graphs differing by isolated vertices, and a key identity (Lemma 4.2, with a dump-label version in Lemma 4.4) converts the algebra operator into combinatorial subdivision: $\llbracket \mathrm{ni}(G)\rrbracket_{(\eta,\tau)} = \mathrm{ni}(\mathrm{sub}(F_v,F_e;G))$. The proofs all run the same course: start from $\mathrm{ni}(G)\ge K_2^{e_G}$, apply the order-preserving operator, use multiplicativity or the dump label to recognise the right-hand side as $K_2^{e_{\mathrm{sub}}}$, and read off Sidorenko; in the forcing cases, equality in the chain makes the inserted forcing graph force quasi-randomness.

What would settle it

Take $G$ to be two isolated vertices, which trivially satisfies the Sidorenko inequality. Its box product with $K_2$ is a matching of two edges, a forest, and forests cannot be forcing because their subgraph densities are matched by weakly regular non-quasi-random sequences; so Theorem 1.3 as stated cannot hold without an additional edge hypothesis. If the intended hypothesis is $e_G\ge 1$, the graph $G=K_2\sqcup I_2$ is Sidorenko but has $2e_G-v_G=-2$, making the chain in equation (16) undefined.

Watch

Extended reading notes

Core claim

The paper's central claim is that the forcing property is inherited by three graph constructions whenever the base graph is Sidorenko: the balanced $m$-fold blow-up for any $m\ge 2$, the $(F,s,t)$-subdivision for any symmetric Sidorenko graph $F$, and the box product $G\square K_2$. In particular, Theorem 1.3 makes the cube $Q_d$ forcing for every $d$, which was previously only known to satisfy the weaker Sidorenko property. The reason the three cases fit into one proof is algebraic: on the algebra of graph densities, a graph $G$ is Sidorenko exactly when its non-induced version $\mathrm{ni}(G)$ dominates $K_2^{e_G}$ in the positivity order, and the authors construct order-preserving operators that turn this inequality into the corresponding inequality for the constructed graph. Equality in the resulting chain then transfers forcing, because the inserted gadget forces the host sequence to be quasi-random. The same operator calculus yields Theorem 1.4, that $K_3$- and $P_k$-subdivisions preserve forcing pairs, and Theorem 1.5, that loose and even hypergraphs obtained from a Sidorenko graph are Sidorenko.

Load-bearing premise

The statements do not include an edge hypothesis, but the box-product proof needs the exponent $2e_G-v_G$ to be nonnegative and the main subdivision lemma needs the base graph to have no isolated vertices; for a trivially Sidorenko graph such as two isolated vertices the theorem would declare a matching forcing, which is false.

Editorial extensions

If this is right

  • The box product theorem implies every cube $Q_d$ with $d\ge 2$ is forcing, since $Q_{d+1}=Q_d\square K_2$ and each $Q_d$ is Sidorenko once the previous step is known.
  • Every Sidorenko graph has a forcing balanced blow-up already when each vertex is replaced by two clones, not merely for sufficiently large blow-up parameter.
  • Subdividing a Sidorenko graph by any symmetric Sidorenko graph preserves Sidorenko, and if the subdivision gadget is forcing the whole graph is forcing.
  • Replacing both graphs in a forcing pair by their $K_3$- or $P_k$-subdivisions yields another forcing pair.
  • The loose and even hypergraph constructions turn any 2-uniform Sidorenko graph into a Sidorenko hypergraph.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same operator calculus should prove forcing inheritance for any local edge-replacement rule whose replacement gadget is symmetric and forcing, not just for the blow-ups, subdivisions, and box product exhibited here; testing this amounts to finding the corresponding downward functor and upward transformation.
  • The dump-label construction recasts the open problem of whether the Möbius ladder $M_5$ is Sidorenko as a search for a positivity certificate in the graph algebra, and the paper's polynomial bound already improves the previous record for edge densities above about $0.741$; a better $C_5$ lower bound would translate directly into a better lower bound for $M_5$ and could close the gap to $K_2^{17}$.
  • Because multiplicative operators send squares to squares and therefore yield only trivial sum-of-squares certificates, the non-multiplicative dump-label operators are the ones that matter for proving new Sidorenko-type inequalities; this suggests a computational search for operators that make $\mathrm{ni}(M_5)-K_2^{17}$ positive in the algebra.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper introduces a family of order-preserving operators between graph algebras, generalizing parts of Razborov's flag algebra framework, and uses them to prove several new Sidorenko and forcing results. Specifically, it claims that balanced blow-ups of Sidorenko graphs are forcing (Theorem 1.1), that subdivisions of Sidorenko graphs by symmetric Sidorenko graphs are Sidorenko and, when the subdivision graph is forcing, forcing (Theorem 1.2), that the box product G□K2 of a Sidorenko graph with an edge is forcing, which implies that cubes are forcing (Theorem 1.3), that certain forcing pairs are preserved under K3- and Pk-subdivisions (Theorem 1.4), and that loose and even hypergraph expansions of Sidorenko graphs are Sidorenko (Theorem 1.5). The technical core is a 'higher degree' operator construction and a 'dump label' technique that allow isolated vertices to be handled algebraically.

Significance. If the missing hypotheses are supplied, the results are a genuine advance: cubes are shown to be forcing for the first time, and the known family of forcing graphs is substantially enlarged beyond previously tractable classes. The algebraic framework is elegant, and the reductions to known forcing base graphs such as C4 and K_{m,m} are transparent and appear sound. The authors are also commendably explicit about limitations, as in the discussion of the Möbius ladder M5 in Section 9. However, as stated the main theorems are false for edgeless graphs, so a revision is required before the claims are correct.

major comments (3)
  1. [Theorems 1.1–1.3] The theorems are stated for every Sidorenko graph G, but they fail for edgeless G. The graph I_2 is Sidorenko since t(I_2,H)=1=t(K_2,H)^0. Theorem 1.3 asserts that I_2□K_2 is forcing, yet I_2□K_2 is two disjoint edges, a forest. For p=1/2 and H_n=K_{\lfloor n/2\rfloor}\sqcup K_{\lceil n/2\rceil}, one has t(K_2,H_n)=p+o(1) and t(I_2□K_2,H_n)=p^2+o(1), while t(C_4,H_n)=1/8+o(1)\neq p^4=1/16, so the sequence is not p-quasi-random. The same example also contradicts the blow-up statement of Theorem 1.1 and the subdivision statement of Theorem 1.2. The statements therefore need an explicit hypothesis such as e(G)\geq 1.
  2. [Section 6, Eq. (16)] The proof of Theorem 1.3 multiplies by •^{2e_G-v_G} and later effectively divides by the same factor. When e_G < v_G/2 this exponent is negative, so the expression is not defined in the algebra A; examples include I_2 and, more generally, any Sidorenko graph with more isolated vertices than edges. Thus the chain in Equation (16) is invalid for such sparse G. The argument can likely be repaired by multiplying by a sufficiently large power of • and canceling later, but as written the proof is incomplete.
  3. [Section 4, Lemma 4.2] Lemma 4.2 is proved only for graphs G without isolated vertices, and the text explicitly notes that the statement fails if G has isolated vertices and F_v is not an independent set. Theorems 1.1 and 1.2, however, are stated for all Sidorenko graphs G. Since the proof of Theorem 5.1, which implies Theorems 1.1 and 1.2, applies Lemma 4.2, the proof as written does not cover Sidorenko graphs with isolated vertices even when e(G)>0. This should be fixed either by adding the hypothesis 'without isolated vertices' to Theorems 1.1 and 1.2 or by explaining how to reduce to the non-isolated part.
minor comments (5)
  1. [Section 2] The inserted Monty Python quotation (the 'Knights Who Say ni!') is out of place in a research paper and should be removed.
  2. [Theorem 1.2] The word 'subdivison' is misspelled in Theorem 1.2 and in the surrounding text; it should read 'subdivision'.
  3. [References] Reference [30] is listed with the same arXiv identifier as [29]; one of the two entries is presumably incorrect.
  4. [Section 9] In the phrase 'when K2 ≥ 0.74142', the intended meaning is that the edge density t(K2,H) is at least 0.74142; this should be made explicit.
  5. [Section 5] In the proof of Theorem 5.1, the notation /llbracket ni(K2) /rrbracket^{e_G}_{(η,τ)} is ambiguous; adding parentheses around the operator application would improve clarity.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the new forcing results are derived from assumed Sidorenko inputs plus external forcing base graphs; the edgeless-G counterexample is a correctness gap, not a circular step.

full rationale

The derivation chain is self-contained in the relevant sense. Theorems 1.1–1.3 are proved by applying the order-preserving operators of Section 3 to the assumed Sidorenko inequalities and then invoking external forcing facts: C4 forcing (Chung–Graham–Wilson), K_{m,m} forcing (Skokan–Thoma), and the assumed forcing of F in Theorem 1.2. These base facts are not outputs of this paper. The algebraic machinery (positivity, operators, subdivision lemmas) is proved in Sections 2–4 rather than cited from the authors' own prior work; the only self-citation, [17], is a footnote allusion to a category-theoretic formulation and has no load-bearing role. Section 9's admission that the Möbius ladder M5 is not covered is an honest limitation, not circular. The notable problem is a correctness gap rather than circularity: Theorems 1.1–1.3 are stated for every Sidorenko G without requiring e(G) ≥ 1, yet Lemma 4.2 is restricted to graphs without isolated vertices and the chain in equation (16) uses •^{2e_G − v_G}, which is not defined for sparse G; for G = I_2 the asserted output graphs are forests and hence not forcing, so the claims are false as stated. This is an omitted-hypothesis/quantifier error, not an equivalence-by-construction or self-citation circularity, so the circularity score remains 0.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The results are conditional on known Sidorenko and forcing graphs from the literature; no free numerical parameters are introduced. The algebraic constructs, namely downward functors, upward transformations, and the dump label, are explicitly defined and are not external postulates.

assumptions (5)
  • domain assumption C4 is forcing (Chung, Graham, and Wilson)
    Used in Theorem 6.1 to conclude quasi-randomness from equality in the box-product inequality chain.
  • domain assumption Complete bipartite graphs K_{m,m} are forcing (Skokan and Thoma)
    Used in Theorem 5.1 and Theorem 1.1 to transfer forcing to balanced blow-ups.
  • domain assumption Known forcing pairs, specifically (C_{2t}, C_{2s}) and (K3, K3-subdivision of G), are forcing (Chung, Graham, and Wilson; Reiher and Schacht)
    Used in the proof of Theorem 1.4 for forcing pairs.
  • standard math Standard properties of homomorphism densities and the graph algebra quotient A are consistent
    The paper provides proofs for the main propositions; the underlying theory follows Razborov and Lovasz and Szegedy.
  • domain assumption The base graphs G and F are Sidorenko
    The theorems are conditional on this hypothesis; it is the input assumption, not a free postulate.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Forcing Graphs to be Forcing." pith.science (2026). https://pith.science/paper/PC5USJHE

@misc{pith2026241212904,
  author       = {Pith},
  title        = {Pith review of: Forcing Graphs to be Forcing},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PC5USJHE}},
  note         = {Machine review of arXiv:2412.12904}
}
read the original abstract

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing conjecture further strengthens this, claiming that any minimizer in fact needs to be quasi-random. Here we extend the family of bipartite graphs for which the forcing conjecture is known to hold to include balanced blow-ups of Sidorenko graphs and subdivisions of Sidorenko graphs by a forcing graph. This partially generalizes results by Conlon et al. (2018) and Conlon and Lee (2021). We also show that the box product of a Sidorenko graph with an edge is forcing, partially generalizing results of Kim, Lee, and Lee (2016) and, in particular, showing that cubes are forcing. We achieve these results through algebraic arguments building on Razborov's flag algebra framework (2007). This approach additionally allows us to construct Sidorenko hypergraphs from known 2-uniform Sidorenko graphs and to study forcing pairs.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

30 extracted references · 25 canonical work pages

  1. [1]

    Combinatorics, Probabili ty and Computing 29(1), 44–67 (2020)

    Bennett, P., Dudek, A., Lidick´ y, B., Pikhurko, O.: Mini mizing the number of 5-cycles in graphs with given edge-density. Combinatorics, Probabili ty and Computing 29(1), 44–67 (2020). https://doi.org/10.1017/S0963548319000257

    doi:10.1017/s0963548319000257 2020

  2. [2]

    Combinatorica 40(4), 455–471 (2020)

    Blekherman, G., Raymond, A., Singh, M., Thomas, R.R.: Si mple graph density inequalities with no sum of squares proofs. Combinatorica 40(4), 455–471 (2020)

    work page 2020

  3. [3]

    Combinatorica 9, 345–362 (1989) 18

    Chung, F.R.K., Graham, R.L., Wilson, R.M.: Quasi-rando m graphs. Combinatorica 9, 345–362 (1989) 18

    work page 1989

  4. [4]

    Geo- metric and Functional Analysis 20, 1354–1366 (2010)

    Conlon, D., Fox, J., Sudakov, B.: An approximate version of Sidorenko’s conjecture. Geo- metric and Functional Analysis 20, 1354–1366 (2010)

    work page 2010

  5. [5]

    Random Structures & Algorithms 40(1), 1–38 (2012)

    Conlon, D., H` an, H., Person, Y., Schacht, M.: Weak quasi -randomness for uniform hyper- graphs. Random Structures & Algorithms 40(1), 1–38 (2012)

    work page 2012

  6. [6]

    Journal of the London Mathematical Society 98(3), 593–608 (2018)

    Conlon, D., Kim, J.H., Lee, C., Lee, J.: Some advances on S idorenko’s conjecture. Journal of the London Mathematical Society 98(3), 593–608 (2018)

    work page 2018

  7. [7]

    Advances in Mathematics 315, 130–165 (2017)

    Conlon, D., Lee, J.: Finite reflection groups and graph no rms. Advances in Mathematics 315, 130–165 (2017)

    work page 2017

  8. [8]

    Discrete Analysis (mar 30 2021)

    Conlon, D., Lee, J.: Sidorenko’s conjecture for blow-up s. Discrete Analysis (mar 30 2021). https://doi.org/10.19086/da.21472

    doi:10.19086/da.21472 2021

Show all 30 references
  1. [9]

    International Mathematics Research Notices 2024(13), 10285–10297 (04 2024)

    Conlon, D., Lee, J., Sidorenko, A.: Extremal numbers and Sidorenko’s conjec- ture. International Mathematics Research Notices 2024(13), 10285–10297 (04 2024). https://doi.org/10.1093/imrn/rnae071

    2024 doi

  2. [10]

    Russian Mathematical Surveys 75(4), 627 (2020)

    Coregliano, L.N., Razborov, A.A.: Semantic limits of d ense combinatorial objects. Russian Mathematical Surveys 75(4), 627 (2020)

    2020

  3. [11]

    arXiv preprint arXiv:2206.10058 (2022)

    Garg, P., Raymond, A., Redlich, A.: Non-trivial square s and Sidorenko’s conjecture. arXiv preprint arXiv:2206.10058 (2022)

    2022 arXiv

  4. [12]

    Journal of Pure and Applied Algebra 192(1-3), 95–128 (2004)

    Gatermann, K., Parrilo, P.A.: Symmetry groups, semide finite programs, and sums of squares. Journal of Pure and Applied Algebra 192(1-3), 95–128 (2004)

    2004

  5. [13]

    The American Mathematical Monthly 66(9), 778–783 (1959)

    Goodman, A.W.: On sets of acquaintances and strangers a t any party. The American Mathematical Monthly 66(9), 778–783 (1959)

    1959

  6. [14]

    Electronic Notes in Discrete Mathematics 38, 437–442 (2011)

    H` an, H., Person, Y., Schacht, M.: Note on forcing pairs . Electronic Notes in Discrete Mathematics 38, 437–442 (2011)

    2011

  7. [15]

    Is rael Journal of Mathematics 175, 125–150 (2010)

    Hatami, H.: Graph norms and Sidorenko’s conjecture. Is rael Journal of Mathematics 175, 125–150 (2010)

    2010

  8. [16]

    arXiv preprint arXiv:2408.03491 (2024)

    Im, S., Li, R., Liu, H.: Sidorenko’s conjecture for subd ivisions and theta substitutions. arXiv preprint arXiv:2408.03491 (2024)

    2024 arXiv

  9. [17]

    In: Proceedings of Discrete Mathematics Days (2024)

    Kiem, A., Pokutta, S., Spiegel, C.: Categorification of flag algebras. In: Proceedings of Discrete Mathematics Days (2024)

    2024

  10. [18]

    Transactions of the American Mathematical Society 368(7), 5057–5074 (2016)

    Kim, J.H., Lee, C., Lee, J.: Two approaches to Sidorenko ’s conjecture. Transactions of the American Mathematical Society 368(7), 5057–5074 (2016)

    2016

  11. [19]

    Journal of Combinatorial Theory, Series B 100(2), 151–160 (2010) 19

    Kohayakawa, Y., Nagle, B., R¨ odl, V., Schacht, M.: Weak hypergraph regularity and linear hypergraphs. Journal of Combinatorial Theory, Series B 100(2), 151–160 (2010) 19

    2010

  12. [20]

    arXiv preprint arXiv:1107.1153 (2011)

    Li, J., Szegedy, B.: On the logarithimic calculus and Si dorenko’s conjecture. arXiv preprint arXiv:1107.1153 (2011)

    2011 arXiv

  13. [21]

    Journal of Combinatorial Theory, Series B 96(6), 933–957 (2006)

    Lov´ asz, L., Szegedy, B.: Limits of dense graph sequenc es. Journal of Combinatorial Theory, Series B 96(6), 933–957 (2006)

    2006

  14. [22]

    arXiv preprint arXiv:2309.12873 (2023)

    Nie, J., Spiro, S.: Sidorenko hypergraphs and random Tu r´ an numbers. arXiv preprint arXiv:2309.12873 (2023)

    2023 arXiv

  15. [23]

    Algebraic Combinatorics 1(2), 249–274 (2018)

    Raymond, A., Singh, M., Thomas, R.R.: Symmetry in Tur´ a n sums of squares polynomials from flag algebras. Algebraic Combinatorics 1(2), 249–274 (2018)

    2018

  16. [24]

    The Journal of Symbolic Logic 72(4), 1239–1282 (2007)

    Razborov, A.A.: Flag algebras. The Journal of Symbolic Logic 72(4), 1239–1282 (2007)

    2007

  17. [25]

    In: Forum of Mathemat- ics, Sigma

    Reiher, C., Schacht, M.: Forcing quasirandomness with triangles. In: Forum of Mathemat- ics, Sigma. vol. 7, p. e9. Cambridge University Press (2019)

    2019

  18. [26]

    Graphs and Combinatorics 9(2), 201–204 (1993)

    Sidorenko, A.: A correlation inequality for bipartite graphs. Graphs and Combinatorics 9(2), 201–204 (1993)

    1993

  19. [27]

    Progress in graph theory (Waterloo, Ont., 198 2) pp

    Simonovits, M.: Extremal graph problems, degenerate e xtremal problems, and supersatu- rated graphs. Progress in graph theory (Waterloo, Ont., 198 2) pp. 419–437 (1984)

    1984

  20. [28]

    Graphs and Combina- torics 20, 255–262 (2004)

    Skokan, J., Thoma, L.: Bipartite subgraphs and quasi-r andomness. Graphs and Combina- torics 20, 255–262 (2004)

    2004

  21. [30]

    arXiv preprint arXiv:1406.6738 (2014)

    Szegedy, B.: Relative entropy and Sidorenko’s conject ure. arXiv preprint arXiv:1406.6738 (2014)

    2014 arXiv

  22. [31]

    math.tau.ac.il/~yuvalwig/math/expository/HypergraphSidorenko.pdf 20

    Wigderson, Y.: Complete r-partite r-graphs are Sidore nko a brief exposition http://www. math.tau.ac.il/~yuvalwig/math/expository/HypergraphSidorenko.pdf 20

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.