1 results
A BK inequality for random matchings
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 32 / Issue 1 / January 2023
- Published online by Cambridge University Press:
- 22 July 2022, pp. 151-157
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
-
Let
$G=(S,T,E)$
be a bipartite graph. For a matching
$M$
of
$G$
, let
$V(M)$
be the set of vertices covered by
$M$
, and let
$B(M)$
be the symmetric difference of
$V(M)$
and
$S$
. We prove that if
$M$
is a uniform random matching of
$G$
, then
$B(M)$
satisfies the BK inequality for increasing events.
