arXiv (All)
open access
On the Stability of the Independence Number in Random Distance Graphs
We consider a random subgraph $G_p(n,r,<s)$ of the complete distance graph $G(n,r,<s)$ whose vertices are the $r$-element subsets of the set $\{1,\dots,n\}$ and whose edges join pairs of subsets that intersect in fewer than $s$ elements; each edge survives independently of the others with probabilit
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
- Generalized Zykov's Theorem#1082998
- Probability threshold for the stability of $α(G(n,r,s))$#1154767
- Improved bounds for lines and $1$-separated sets in Euclidean Ramsey theory#819399
- Improved bounds for lines and $1$-separated sets in Euclidean Ramsey theory#809406
- Independent natural extension for choice functions#84673
Record · ID 986522
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