On the Stability of the Independence Number of the Distance Graph G(n,r,<s) for Growing r and s

Vsevolod A. Pokhachevskiy; Andrei Raigorodskii

Home/Archive/arXiv

arXiv · 2610.16955

On the Stability of the Independence Number of the Distance Graph G(n,r,<s) for Growing r and s

Vsevolod A. Pokhachevskiy·Andrei Raigorodskii

View original source ↗Read source document ↗Export metadata ↓

Abstract

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,...,n} and whose edges join pairs of subsets that intersect in fewer than s elements; each edge survives independently of the others with probability p. The stability of the Erdos-Ko-Rado theorem is the event that the independence number of the random subgraph equals that of the original graph, N = C_{n-s}^{r-s}. For fixed r and s, two-sided bounds for the critical probability, whose ratio depends on r and s, were obtained by P. A. Ogarok and A. M. Raigorodskii. In this paper we establish the order of the critical probability for growing r=r(n) and s=s(n): if min{C_r^s r^2, s r^3} = o(n), then the upper and lower bounds differ only by an absolute constant factor. The proof is elementary; only one of the two branches of the growth condition uses the complete nontrivial-intersection theorem of Ahlswede-Khachatrian.

Explore related subjects

math.CO math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Vsevolod A. Pokhachevskiy, Andrei Raigorodskii. 2026-10-12. On the Stability of the Independence Number of the Distance Graph G(n,r,<s) for Growing r and s. https://arxiv.org/abs/2610.16955

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On composition and decomposition operations for vector spaces, graphs and matroids

In this paper, we study the ideas of composition and decomposition in the context of vector spaces, graphs and matroids. For vector spaces $\V_{AB},$ treated as collection of row vectors, with specified column set $A\uplus B,$ we define $\V_{SP}\lrarv \V_{PQ}, S\cap Q= \emptyset, $ to be the collection of all vectors $(f_S,f_Q)$ such that $(f_S,f_P)\in \V_{SP}, (f_P,f_Q)\in \V_{PQ}$. An analogous operation $\G_{SP}\lrarg \G_{PQ}\equivd \G_{PQ}$ can be defined in relation to graphs $\G_{SP}, \G_{PQ},$ on edge sets $S\uplus P, P\uplus Q,$ respectively in terms of an overlapping subgraph $\G_P$ which gets deleted in the right side graph (see for instance the notion of $k-sum$ \cite{oxley}). For matroids we define the `linking' $\M_{SP}\lrarm \M_{PQ} \equivd (\M_{SP}\vee \M_{PQ})\times (S\uplus Q)$, denoting the contraction operation by '$\times$'. In each case, we examine how to minimize the size of the `overlap' set $P,$ without affecting the right side entity. In the case of vector spaces, there is a polynomial time algorithm for achieving the minimum, which we present. Similar ideas work for graphs and for matroids under appropriate conditions. Next we consider the problem of decomposition. Here, in the case of vector spaces, the problem is to decompose $\V_{SQ}$ as $\V_{SP}\lrarv \V_{PQ},$ with minimum size $P.$ We give a polynomial time algorithm for this purpose. In the case of graphs and matroids we give a solution to this problem under certain restrictions.

math.CO↗

arXiv2026

Exploring the unleaved tree of numerical semigroups up to a given genus

We present a new algorithm for exploring or counting the numerical semigroups of a given genus that uses the unleaved version of the tree of numerical semigroups. In the unleaved tree there are no leaves rather than the ones at depth equal to the genus in consideration. For exploring the unleaved tree we present a new encoding system of a numerical semigroup given by the gcd of its left elements and its shrinking, that is, the semigroup generated by its left elements divided by their gcd. We show a method to determine the right generators and strong generators of a semigroup by means of the gcd and the shrinking encoding, as well as a method to encode a semigroup from the encoding of its parent or of its preceding sibling. With the new algorithm, we obtained $n_{76}=29028294421710227$ and $n_{77}=47008818196495180$.

math.CO↗

arXiv2026

On a question about real rooted polynomials and f-polynomials of simplicial complexes

For a polynomial $f(t) = 1+f_0t+\cdots +f_{d-1}t^d$ with positive integer coefficients Bell and Skandera ask if real rootedness of f(t) implies that there is a simplicial complex with f-vector $(1,f_0 \ldots,f_{d-1})$. In this paper we discover properties implied by the real rootedness of f(t) in terms of the binomial representation $f_i = \binom{x_{i+1}}{i+1}, i \geq 0$. We use these to provide a sufficient criterion for a positive answer to the question by Bell and Skandera. We also describe two further approaches to the conjecture and use one to verify that some well studied real rooted classical polynomials are f-polynomials. Finally, we provide a series of results showing that the set of f-vectors of simplicial complexes is closed under constructions also preserving real rootedness of their generating polynomials.

math.CO↗