arXiv (All)
open access
The replica symmetric solution for hypergraph independent sets in the critical regime
We prove a variational formula for the logarithmic asymptotics of a non-existence probability in a broad class of combinatorial problems such as avoiding cliques in random graphs and $k$-term arithmetic progressions in random subsets of integers. These results follow from a formula for the probabili
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
- Random independent sets in uncrowded hypergraphs#1218499
- Multiset Colorings of Random Graphs Across Density Regimes#1049104
- A counterexample to the Erdős--Sós bipartite-link conjecture#1248922
- Greedy Uniformity on Trees: Exact Obstruction and Near-Uniform Spiders#1186590
- The Exact Law of Large Numbers for Independent Random Matching#21082
Record · ID 1234858
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