Related papers: Stability for maximal independent sets
We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges (braces). We show that for any positive integer $b$ there is such an inductive…
Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Engbers and Galvin asked how large $i_t(G)$ could be in graphs with minimum degree at least $\delta$. They further conjectured that when $n\geq 2\delta$ and $t\geq…
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…
The notion of augmenting graphs generalizes Berge's idea of augmenting chains, which was used by Edmonds in his celebrated solution of the maximum matching problem. This problem is a special case of the more general maximum independent set…
The stable matching problem is a prototype model in economics and social sciences where agents act selfishly to optimize their own satisfaction, subject to mutually conflicting constraints. A stable matching is a pairing of adjacent…
We study the expanding properties of random perturbations of regular interval maps satisfying the summability condition of exponent one. Under very general conditions on the interval maps and perturbation types, we prove strong stochastic…
A graph $G$ is $H$-covered by some given graph $H$ if each vertex in $G$ is contained in a copy of $H$. In this note, we give the maximum number of independent sets of size $t\ge 3$ in $K_n$-covered graphs of size $N\ge n+t-1$ and determine…
Stochastic dynamical systems consisting of non-invertible continuous maps on an interval are studied. It is proved that if they satisfy the recently introduced so-called $\mu$-injectivity and some mild assumptions, then proximality,…
A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.
We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…
A detailed analysis of conditions on 2-body interaction potential, which ensure stability, superstability or strong superstability of statistical systems is given. There has been given the connection between conditions of superstability…
Recently, Davies, Jenssen, Perkins, and Roberts gave a very nice proof of the result (due, in various parts, to Kahn, Galvin-Tetali, and Zhao) that the independence polynomial of a $d$-regular graph is maximized by disjoint copies of…
Takahasi and Higman independently proved that any ascending chain of subgroups of constant rank in a free group must stabilize. Kapovich and Myasnikov gave a proof of this fact in the language of graphs and Stallings folds. Using profinite…
Extremal problems involving independent sets are much studied. Two of the most important extremal problems in this context are concerned with the sharp upper bounds for the number of independent sets of fixed size and the independence…
In the paper we state and prove theorem describing the upper bound on number of the graphs that have fixed number of vertices |V| and can be colored with the fixed number of n colors. The bound relates both numbers using power of 2, while…
The article considers systems of interacting particles on networks with adaptively coupled dynamics. Such processes appear frequently in natural processes and applications. Relying on the notion of graph convergence, we prove that for large…
The coexistence of infinitely many attractors is called extreme multistability in dynamical systems. In coupled systems, this phenomenon is closely related to partial synchrony and characterized by the emergence of a conserved quantity. We…
We establish a majorization-based theory for bounding observables of waves with varied coherence. For any measurement, exact bounds are attained by the maximal and minimal elements in the set of input coherence spectra. The set's supremum…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
Denote by $K_p(n,k)$ the random subgraph of the usual Kneser graph $K(n,k)$ in which edges appear independently, each with probability $p$. Answering a question of Bollob\'as, Narayanan, and Raigorodskii,we show that there is a fixed $p<1$…