Stability of the independence number of G(n, r, 1) graphs
Abstract
In this paper we obtain the stability theorem for the independence number of G(n, r, 1) graphs. This result was previously stated in the paper of M. Pyaderkin but the proof there was incorrect. We introduce the correct proof of the key lemma and thus finally complete the proof of this theorem.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.