arXiv (All)
open access
Central Limit Theorem of Maximum Weight Matching on Random Graphs with Prescribed Degrees
We prove an annealed central limit theorem for the weight of the maximum weight matching on uniformly random simple graphs with prescribed, uniformly bounded degrees and i.i.d. exponential edge weights. In particular, the result applies to random $d$-regular graphs for every fixed $d \ge 2$. The pro
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
- Perfect Matching in $k$-Partite $k$-Uniform Hypergraphs#1141333
- The Full P-vertex Problem and Perfect Matchings for Bipartite Graphs#987518
- A Near-Optimal Linear Range for the Erdős Matching Conjecture#985218
- Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs#628834
- Outer-clique Roman dominating function in graphs#72023
Record · ID 1144186
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