Conceptio › Archive › arXiv (All)
arXiv (All) open access

Edges of the uniform random forest of $K_n$ are pairwise negatively correlated for every $n$

Gupta, Anish
arXiv (All) · Papers
Open Source ↗Direct PDF ↓
05c30combinatoricsprobability
Let $F_n$ be uniform on all forests of the simple complete graph $K_n$, with isolated vertices allowed. A conjecture of Kahn and of Winkler, studied by Grimmett and Winkler, asserts that any two distinct edges of any finite graph are negatively correlated under the uniform forest measure. Stark prov
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗

Related documents

Record · ID 1062036
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive