arXiv (All)
open access
Local Limit of Random Regular Bipartite Planar Maps
We prove the existence of the local limit of uniform random d-regular bipartite planar maps, for every $d\geq 3$, as the number of vertices tends to infinity. The proof relies on a bijection between maps and so-called blossoming trees established in a previous work. After proving local convergence o
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 rate for the average vacancy of uniformly random matchings in linear hypergraphs#1062035
- Paths maximize the expected range of graph-indexed random walks#1014316
- A $2$-Approximation for Directed Feedback Vertex Set in Locally Semicomplete and Quasi-Transitive Digraphs#1013334
- Linear Tur'an Numbers of Four-Edge Uniform Paths via Incidence Rank#1033943
- Counting almost independent sets in regular graphs#1076184
Record · ID 1014680
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