Negative edge correlation in complete bipartite graphs
math.CO
Submitted: 2026-10-27
Updated: 2026-10-27
License: http://creativecommons.org/licenses/by/4.0/
The gist: We prove strict pairwise negative correlation under both the uniform forest measure and the uniform connected-subgraph measure on the complete bipartite graph K m,n for all m,n at least2.
Abstract
We prove strict pairwise negative correlation under both the uniform forest measure and the uniform connected-subgraph measure on the complete bipartite graph K m,n for all m,n at least2. Under the connected-subgraph measure, any two distinct edges of a fixed copy of K 2,2 remain strictly negatively correlated after conditioning on the subgraph induced by the remaining vertices.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality