--- title: Balanced Supersaturation Conjecture url: https://www.emergentmind.com/topics/balanced-supersaturation-conjecture type: topic --- # Balanced Supersaturation Conjecture Balanced supersaturation is a label used for two closely related extremal principles. In one formulation, developed by Morris and Saxton for bipartite graphs, it requires not only many copies of a forbidden configuration \(H\) above the extremal threshold but also a family of such copies whose degrees and co-degrees are uniformly controlled in the auxiliary hypergraph of copies [1707.03788]. In the other, formulated by Mubayi for stable non-\(r\)-partite \(r\)-graphs, it predicts a local linear law \[ h_{\mathcal F}(n,q)\ge q\,c(n,\mathcal F), \] where \(h_{\mathcal F}(n,q)\) is the minimum number of copies of \(\mathcal F\) in an \(n\)-vertex \(r\)-graph with \(\ex(n,\mathcal F)+q\) edges, and \(c(n,\mathcal F)\) is the minimum number of copies created by adding one edge to the unique extremal \(\mathcal F\)-free construction [2606.26735]. Recent work has sharply separated these two meanings: the Morris–Saxton programme has been verified for broad degenerate families, while the Mubayi formulation has been refuted by strong counterexamples, first in graphs and then in every uniformity [2208.10572][2606.09518][2606.26735]. ## 1. Two principal formulations The literature records two prominent balanced supersaturation frameworks. | Formulation | Host setting | Core statement | |---|---|---| | Morris–Saxton / Erdős–Simonovits \(\alpha\)-goodness | Bipartite graphs and \(r\)-graphs above \(\ex(n,H)\) by a multiplicative factor | There exists a large family of copies of \(H\) with uniform upper bounds on \(d_{\mathcal H}(\sigma)\) for all non-empty \(\sigma\subset E(G)\) | | Mubayi local balanced supersaturation | Stable non-\(r\)-partite \(r\)-graphs at \(\ex(n,\mathcal F)+q\) edges | The minimum copy count satisfies \(h_{\mathcal F}(n,q)\ge q\,c(n,\mathcal F)\) | Classical supersaturation only asserts that exceeding the extremal threshold forces many copies of the forbidden configuration. Balanced supersaturation strengthens this by imposing a uniformity principle. In the Morris–Saxton setting, the copies must be “uniformly distributed” over edges and small edge sets [1707.03788]. In the Mubayi setting, the strengthening is local and exact: each extra edge is conjectured to incur at least the one-edge cost \(c(n,\mathcal F)\), independently of the others [2606.09518]. The distinction is substantive. The Morris–Saxton notion is tailored to hypergraph containers and counting problems, whereas Mubayi’s version is a fine-grained local statement about the structure of minimum supersaturation just above \(\ex(n,\mathcal F)\) [2208.10572][2606.26735]. ## 2. Morris–Saxton balanced supersaturation and \(\alpha\)-goodness For a family \(\mathcal H\) of copies of a fixed graph or \(r\)-graph \(H\) in a host \(G\), the key parameter is \[ d_{\mathcal H}(\sigma)=|\{A\in \mathcal H:\sigma\subset A\}|, \] defined for \(\sigma\subset E(G)\). Balanced supersaturation demands lower bounds on \(|\mathcal H|\) together with upper bounds on \(d_{\mathcal H}(\sigma)\) for every small \(\sigma\) [2208.10572]. Morris and Saxton encapsulated this via Erdős–Simonovits \(\alpha\)-goodness. In the formulation used by later work, an \(r\)-graph \(H\) is Erdős–Simonovits \(\alpha\)-good for a scale \(m(n)\) if every \(r\)-graph \(G\) with \(k\,m(n)\) edges contains a non-empty collection \(\mathcal H\) of copies of \(H\) such that \[ d_{\mathcal H}(\sigma)\le C\,\tau^{|\sigma|-1}k^{(1+\alpha)(|\sigma|-1)}e(G) \] for every non-empty \(\sigma\subset E(G)\) with \(1\le |\sigma|\le e(H)\), for suitable constants \(C\) and \(k_0\) and a small parameter \(\tau\) [1707.03788]. This is a co-degree control statement in the auxiliary hypergraph of copies. The prototype is the Morris–Saxton theorem for even cycles. For every \(\ell\ge2\), there exist constants \(C>0\), \(\delta>0\), and \(k_0\) such that every graph \(G\) with \(n\) vertices and \(k n^{1+1/\ell}\) edges contains a collection \(\mathcal H\) of copies of \(C_{2\ell}\) satisfying \[ |\mathcal H|\ge \delta k^{2\ell}n^2 \] and \[ d_{\mathcal H}(\sigma)\le C\cdot k^{2\ell-|\sigma|-\frac{|\sigma|-1}{\ell-1}} n^{1-1/\ell} \] for every \(\sigma\subset E(G)\) with \(1\le |\sigma|\le 2\ell-1\) [2208.10572]. The theorem is stronger than numerical supersaturation because it forbids concentration of most copies on a small fraction of edges. Morris and Saxton then conjectured that every bipartite graph \(H\) containing a cycle should satisfy an analogous property: if \(G\) has \(k\cdot \ex(n,H)\) edges, then there should exist a non-empty collection \(\mathcal H\) of copies of \(H\) such that \[ d_{\mathcal H}(\sigma)\le \frac{C\cdot |\mathcal H|}{k^{(1+\varepsilon)(|\sigma|-1)} e(G)} \] for all \(\sigma\subset E(G)\) with \(1\le |\sigma|\le e(H)\), for some constants \(C,\varepsilon,k_0\) depending on \(H\) [2208.10572]. ## 3. Verified cases and container-theoretic consequences A major early verification was obtained for degenerate families. For every \(\Theta\)-graph \(\Theta_{a,b}\) with \(a,b>2\), there are constants \(C,\delta,k_0\) such that every graph \(G\) with \[ e(G)=k\,n^{1+1/b} \] contains a family \(\mathcal H\) of copies of \(\Theta_{a,b}\) with \[ |\mathcal H|\ge \delta\,k^{ab}n^2 \] and \[ d_{\mathcal H}(\sigma)\le \delta\,k^{(1+\alpha)(|\sigma|-1)}e(G), \qquad \alpha=\frac{1}{ab-1}, \] for every \(\sigma\subset E(G)\) with \(1\le |\sigma|\le ab\) [1707.03788]. The same paper proved an analogous theorem for complete \(r\)-partite \(r\)-graphs \(K^{(r)}_{a_1,\dots,a_r}\), with \[ |\mathcal H|\ge \delta\,k^{a_1\cdots a_r} n^{a_1+\cdots+a_{r-1}} \] and \[ d_{\mathcal H}(\sigma)\le \delta\,k^{(1+\alpha)(|\sigma|-1)}e(G), \qquad \alpha=\frac{1}{a_1\cdots a_{r-1}}, \] for all \(1\le |\sigma|\le a_1\cdots a_r\) [1707.03788]. These results were described as confirming the Morris–Saxton conjecture for most theta graphs and the corresponding hypergraph statements for most complete \(r\)-partite \(r\)-graphs. Jiang and Longbrake later proved a general quantitative theorem under a mild hypothesis on the Turán exponent. If \(H\) is an \(r\)-partite \(r\)-graph, \(\ex(n,H)\le A n^\alpha\), and \(\alpha>r-\frac1{m_r(H)}\), then every \(n\)-vertex \(r\)-graph \(G\) with \(e(G)=k n^\alpha\) contains a non-empty family \(\mathcal H\) of copies of \(H\) such that \[ d_{\mathcal H}(S)\le C\,k^{-\lambda(\alpha,H)(|S|-1)}\frac{|\mathcal H|}{e(G)}, \qquad \lambda(\alpha,H)=\frac{1}{m_r(H)(r-\alpha)}, \] for every \(S\subseteq E(G)\) with \(1\le |S|\le e(H)\) [2208.10572]. Since \(\lambda(\alpha,H)>1\), this yields the Morris–Saxton conjecture in a more explicit form whenever the mild exponent condition holds. In the graph case, this applies to bipartite \(H\) with cycles under the corresponding assumption on \(\ex(n,H)\) [2208.10572]. The primary reason for these bounds is methodological. If \(H\) is Erdős–Simonovits \(\alpha\)-good for \(m(n)\), then the number of \(H\)-free \(r\)-graphs on \(n\) vertices is at most \[ 2^{O(m(n))}, \] and the number of \(H\)-free \(r\)-graphs with \(o(m(n))\) edges is \(2^{o(m(n))}\) [1707.03788]. Jiang–Longbrake further used balanced supersaturation to obtain general upper bounds on \(\ex(G(n,p),H)\) for bipartite \(H\) in random graphs, describing these as the first general results of this kind [2208.10572]. ## 4. Mubayi’s local balanced supersaturation conjecture The second formulation begins with \[ h_F(n,q)=\min\{N_F(G): |V(G)|=n,\ e(G)=\ex(n,F)+q\}, \] where \(N_F(G)\) is the number of copies of \(F\) in \(G\), and with \[ c(n,F)=t_F(n,1), \] the minimum number of copies obtained by adding one edge to an extremal \(F\)-free graph [2606.09518]. For \(r\)-graphs \(\mathcal F\), the same notation is used in labelled form: \[ h_{\mathcal F}(n,q)=\min\{N_{\mathcal F}(\mathcal H): |\mathcal H|=\ex(n,\mathcal F)+q\}, \] and \[ c(n,\mathcal F)=\min\Bigl\{N_{\mathcal F}(\mathrm{EX}(n,\mathcal F)\cup\{e\};e)\Bigr\}, \] where \(\mathrm{EX}(n,\mathcal F)\) is the unique extremal \(\mathcal F\)-free \(r\)-graph when uniqueness holds [2606.26735]. Mubayi’s conjecture is formulated for stable non-\(r\)-partite \(r\)-graphs. Stability means that, for all sufficiently large \(n\), the extremal \(\mathcal F\)-free \(n\)-vertex \(r\)-graph is unique, and every near-extremal \(\mathcal F\)-free \(n\)-vertex \(r\)-graph differs from it in only \(o(n^r)\) edges [2606.26735]. Under this hypothesis, the conjecture states that for every positive integer \(q\) and all sufficiently large \(n\), \[ h_{\mathcal F}(n,q)\ge q\,c(n,\mathcal F) \] [2606.26735]. In the graph case \(r=2\), this becomes: if \(F\) is a non-bipartite stable graph, then for any fixed \(q\), when \(n\) is large, \[ h_F(n,q)\ge q\,c(n,F) \] [2606.09518]. The conjecture is motivated by positive cases. For cliques \(K_t\), classical results of Rademacher, Erdős, and Lovász–Simonovits show that minimum supersaturation just above \(\ex(n,K_t)\) is achieved by adding edges to a Turán graph. Mubayi extended this principle to color-critical graphs, and Pikhurko and Yilma sharpened it to the exact identity \[ h_F(n,q)=t_F(n,q) \] for color-critical graphs whenever \(1\le q\le \varepsilon_F n\) [2606.09518]. In these families, the balanced linear heuristic is accurate. ## 5. Graph counterexamples and the collapse of one-edge balance Ma and Yuan constructed stable non-bipartite graph counterexamples to Mubayi’s conjecture for every fixed \(q\ge4\), leaving open the one-edge question \[ h_F(n,1)=t_F(n,1)=c(n,F) \] for graphs \(F\) containing a cycle [2606.09518]. Chen and Yuan gave a negative answer by building a family \(H_t\) for \(t\ge6\). The graph \(H_t\) is the \(3t\)-book expansion of the path \(P_t\), written \[ H_t=P_t^{(3t)}. \] Starting from the path \(v_1,\dots,v_t\), each core edge \(v_i v_{i+1}\) is replaced by a \(3t\)-page book: a set \(Z_i\) of \(3t\) vertices, each adjacent to both \(v_i\) and \(v_{i+1}\) [2606.09518]. Since each book consists of triangles, \(H_t\) is non-bipartite. For \(n=2(t-1)s\) with \(s\) large, the unique extremal \(H_t\)-free graph is \[ T^\star=K_{(t-1)s,(t-1)s}\ \cup\ sK_{t-1}\ \cup\ sK_{t-1}, \] with one copy of \(sK_{t-1}\) inside each side of the complete bipartite graph [2606.09518]. Chen and Yuan compare two constructions: adding one missing edge to \(T^\star\), which defines \(c(n,H_t)\), and a modified graph \(Y_{t,s}\) with \(\ex(n,H_t)+1\) edges but fewer copies of \(H_t\). Their theorem yields \[ h_{H_t}(n,1)\le \frac{t!}{2}\,\Lambda_{t,s}, \qquad c(n,H_t)\ge 2^{t-2}(t-2)!\,\Lambda_{t,s}, \] where \[ \Lambda_{t,s}=\prod_{j=0}^{t-2}\binom{(t-1)s-3tj}{3t} \] [2606.09518]. Consequently, \[ \frac{h_{H_t}(n,1)}{c(n,H_t)} \le \frac{t(t-1)}{2^{t-1}} \xrightarrow[t\to\infty]{}0. \] This has two immediate consequences. First, for each \(t\ge6\), there are infinitely many \(n\) with \[ h_{H_t}(n,1)1\), there exists a stable non-\(r\)-partite \(r\)-graph \(\mathcal F\) and constants \(\delta_{\mathcal F}>0\), \(n_{\mathcal F}\) such that for every \(n\ge n_{\mathcal F}\) and every integer \(q\) with \(1\le q\le \delta_{\mathcal F} n\), \[ h_{\mathcal F}(n,q)\le K^{-1} q\,c(n,\mathcal F) \] [2606.26735]. Thus Mubayi’s conjectured lower bound can already fail at \(q=1\), and the failure can be by an arbitrarily large constant factor in every uniformity. The forbidden hypergraphs are semi-blowup fans \(\mathcal F_{r,t}\). Their extremal theory is explicit: for all sufficiently large \(n\), the unique extremal \(n\)-vertex \(\mathcal F_{r,t}\)-free \(r\)-graph is \[ \mathcal J_{t-1}(n)=K_{t-1}^{(r)}\vee \mathcal T_r^{(r)}(n-t+1), \] and \[ \ex(n,\mathcal F_{r,t}) = \binom nr-\binom{n-t+1}{r}+t_r^{(r)}(n-t+1) \] [2606.26735]. Here \(\mathcal J_{t-1}(n)\) has an exceptional set \(S\) of \(t-1\) full-degree vertices joined to a balanced complete \(r\)-partite \(r\)-graph on the remaining vertices. The mechanism of failure is local overlap. A single added partite non-edge \(e\) creates \[ N_{\mathcal F}(\mathcal J\cup\{e\};e)=\Theta_{\mathcal F}(n^{m_{\mathcal F}}) \] copies, so \(c(n,\mathcal F)=\Theta_{\mathcal F}(n^{m_{\mathcal F}})\) [2606.26735]. However, the copies created by many such added edges are extremely vulnerable to deleting an \(S\)-star \[ \mathcal S(Z)=\{\{z\}\cup Y: z\in Z,\ Y\in \tbinom{S}{r-1}\} \] for a small partite set \(Z\) [2606.26735]. The construction deletes \(\mathcal S(Z)\), adds many partite non-edges inside \(Z\), and balances the edge count so that the resulting hypergraph has exactly \(\ex(n,\mathcal F)+q\) edges. A star-deletion lemma shows that only a proportion \[ \rho_t=c_r(1-\theta_r)^{t-1} \] of the one-edge copies survive, and \(\rho_t\to0\) exponentially as \(t\to\infty\) [2606.26735]. This is the structural source of the strong violation of linear balance. For \(r=2\), \(\mathcal F_{2,t}\) is \(3\)-chromatic, so the construction also gives stable \(3\)-chromatic graph counterexamples, complementing earlier stable examples of Ma and Yuan with arbitrary chromatic number at least four [2606.26735]. ## 7. Extensions, analogies, and present outlook Balanced supersaturation has also been formulated outside the original graph and hypergraph settings. In forbidden subposet theory, a conjecture of the same flavour states that if \[ |\mathcal F|\ge (e(P)+\varepsilon)\binom{n}{\lfloor n/2\rfloor}, \] then \(\mathcal F\) contains at least \(\delta\,M(n,P)\) copies of \(P\), where \(M(n,P)\) is the number of copies of \(P\) in the \(e(P)+1\) middle levels of the Boolean lattice [2007.06854]. This was verified for height-2 tree posets, monotone tree posets, and induced \(K_{s,1,t}\), with almost-balanced results for diamonds [2007.06854]. In balanced bipartite supersaturation near Zarankiewicz thresholds, the \(C_4\) problem exhibits a related uniformity phenomenon. Equality in the Jensen-type lower bound for \(C_4\) holds precisely when the graph is regular and every pair of vertices in the same class has the same number of common neighbors; for the improved bound, equality holds when degrees differ by at most \(1\) and all codegrees differ by at most \(1\) [1711.09282]. This is not a container-style balanced supersaturation theorem, but it shows that minimizing global supersaturation can force strong degree and codegree uniformity. By contrast, some modern supersaturation results remain explicitly global rather than balanced. In clique supersaturation, lower bounds on \(N(F,G)\) as a function of \(N(K_r,G)\) are established, but the paper emphasizes that its results do not provide balanced supersaturation in the container-method sense, and its extremal constructions are often highly unbalanced unions of cliques [2312.08265]. This contrast helps isolate what is genuinely special about balanced supersaturation: it is not merely a lower bound on the number of copies, but a structural anti-concentration statement about where those copies can lie. The present landscape is therefore sharply bifurcated. For bipartite and degenerate families, balanced supersaturation in the Morris–Saxton sense has become a central tool in containers, enumeration, and random Turán theory [1707.03788][2208.10572]. For stable non-\(r\)-partite local supersaturation, stability alone is now known to be insufficient: the semi-blowup fan constructions show that even unique extremality and Erdős–Simonovits-type stability do not prevent dramatic failure of \[ h_{\mathcal F}(n,q)\ge q\,c(n,\mathcal F) \] [2606.26735]. The main open structural problem, as formulated in the hypergraph counterexample paper, is to identify natural additional conditions under which an asymptotic lower bound of the form \[ h_{\mathcal F}(n,q)\ge (1-\varepsilon_n)q\,c(n,\mathcal F) \] with \(\varepsilon_n\to0\) can still be recovered [2606.26735]. Source: https://www.emergentmind.com/topics/balanced-supersaturation-conjecture