Source authenticated

The forcing conjecture for bipartite graphs

Corollary 1.3: for the same connected bipartite $H$ (which contains cycles) there are $p\in(0,1)$ and a nonconstant graphon $W$ with $t(K_2,W)=p$ and $t(H,W)=p^{66}$ ; sampling gives finite graphs with edge and $H$ -densities tending to $p$ and $p^{66}$ but four-cycle density tending to a limit above $p^4$ . So $H$ is not $p$ -forcing at that $p$ , and the conjecture fails. Since the forcing conjecture implies Sidorenko's, this follows from the Sidorenko counterexample; no separate idea is claimed.

Exact FrontierDelta

Prior state unknown→disproved

Scope and record

Occurred: Sep 23, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: unreviewed. Publication: announcement. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: The forcing conjecture for bipartite graphs · Forcing conjecture

Confidence: Not scored

Registry verification: unreviewed · announcement · candidate

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Unreleased internal OpenAI model
model · ai model contributor · OpenAI

Evidence vector

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Named evidence

VibeMathed record: The forcing conjecture for bipartite graphs

specialist registry · passed

No independent mathematician has checked this yet. Checked here: Corollary 1.3 and its proof outline in 'A counterexample to Sidorenko's conjecture', read against the forcing conjecture as quoted from Conlon-Fox-Sudakov. The argument is a short consequence of Theorem 1.1, which is Lean-checked; the corollary itself is not formalized and was not refereed. The manuscript notes it exhibits one density p only and does not claim failure of p-forcing at every density, which is enough to refute the conjecture as stated.

Source ↗

The forcing conjecture for bipartite graphs

witness · pending

Primary source named by the VibeMathed record. Presence in this import is not an independent mathematical verification.

Source ↗

Lean: Sidorenko counterexample (challenge not in formalization.yaml)

lean artifact · pending

lean-proof link supplied by the VibeMathed registry.

Source ↗

Conlon, Fox and Sudakov 2010, An approximate version of Sidorenko's conjecture

specialist registry · pending

problem-record link supplied by the VibeMathed registry.

Source ↗

Artifacts and verifiers

Lean: Sidorenko counterexample (challenge not in formalization.yaml)

lean artifact · pending

Artifact ↗

Compute record

No linked compute attempts recorded.

Lineage and corrections

Lean: Sidorenko counterexample (challenge not in formalization.yaml) evidence for this event

This event attributed to Unreleased internal OpenAI model

Conlon, Fox and Sudakov 2010, An approximate version of Sidorenko's conjecture evidence for this event

The forcing conjecture for bipartite graphs parent of this event

The forcing conjecture for bipartite graphs evidence for this event

VibeMathed record: The forcing conjecture for bipartite graphs evidence for this event

Act on this frontier

Verify, challenge, or extend the result.

Help verify Open canonical problem Explore evidence graph