arXiv (All)
open access
Edges of the uniform random forest of $K_n$ are pairwise negatively correlated for every $n$
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
- A 50-Vertex Cubic Counterexample to the Domination-versus-Edge-Domination Conjecture#997773
- Compactness of abundance in asymmetric hypergraph removal lemmas#800112
- Counting Weight-$k$ Italian Dominating Sets on Trees and Cycles#1154731
- Parameterized complexity of $k$-Coloring in graphs with no long induced paths#1069883
- Disjoint covering of bipartite graphs with $s$-clubs#152998
Record · ID 1062036
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
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
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive