Year: 2026
Type: preprint
Abstract: 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 asymptotic stability of the independence number.
Source: arXiv (Cornell University)
Authors: Koshelev, M. M., Raigorodskii, A. M.
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7216501024