Negative edge correlation in complete bipartite graphs

arXiv:2610.36749 · math.CO · Submitted 2026-10-27 · Read on arXiv

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