arXiv (All)
open access
Probability threshold for the stability of $α(G(n,r,s))$
Let $G(n,r,s)$ be a graph $(V,E)$ such that $V = \binom{[n]}{r}$ and $E = \{(u, v)| |u \cap v| = s\}. $In this paper we study the probability threshold for the exact stability of the independence number of $G(n, r, s)$ where $r > 2s+2$. We improve the previous result of Pyaderkin that implied asympt
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
- On the Stability of the Independence Number in Random Distance Graphs#986522
- Range of Clique Counts in Graphs#1036129
- A combinatorial approach to point-flat incidences over finite fields#1118077
- A set of points with optimal $L^2$ spherical cap discrepancy#1064252
- Asymptotic counting of integers with prime factors $p_{r^a s^b}$#1014028
Record · ID 1154767
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