Related papers: Stability for maximal independent sets
Sums of independent, bounded random variables concentrate around their expectation approximately as well a Gaussian of the same variance. Well known results of this form include the Bernstein, Hoeffding, and Chernoff inequalities and many…
An old problem raised independently by Jacobson and Sch\"onheim asks to determine the maximum $s$ for which every graph with $m$ edges contains a pair of edge-disjoint isomorphic subgraphs with $s$ edges. In this paper we determine this…
A detailed analysis of necessary conditions on a family of many-body potentials, which ensure stability, superstability or strong superstability of a statistical system is given in present work.There has been given also an example of…
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…
An edge-colouring of a graph $G$ is said to be colour-balanced if there are equally many edges of each available colour. We are interested in finding a colour-balanced perfect matching within a colour-balanced clique $K_{2nk}$ with a…
We apply the stabilizer formalism to the Maximum Cut problem, and obtain a new greedy construction heuristic. It turns out to be an elegant synthesis of the edge-contraction and differencing edge-contraction approaches. Utilizing the…
We study asymptotic stability of continuous-time systems with mode-dependent guaranteed dwell time. These systems are reformulated as special cases of a general class of mixed (discrete-continuous) linear switching systems on graphs, in…
We develop a stability theory for contractive local IFSs on compact metric spaces. Unlike the classical global setting, local systems may exhibit a richer symbolic and geometric structure, including code spaces that are not of finite type…
This paper is the first part of a project devoted to studying the interconnection between controllability properties of a dynamical system and the large-time asymptotics of trajectories for the associated stochastic system. It is proved…
For a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let H be the largest matching among such pairs. Let M be a maximum matching of G. We show that 5/4 is a tight upper bound for…
Miller and Muller (1960) and independently Moon and Moser (1965) determined the maximum number of maximal independent sets in an $n$-vertex graph. We give a new and simple proof of this result.
The matching number of a $k$-graph is the maximum number of pairwise disjoint edges in it. The $k$-graph is called $t$-resilient if omitting $t$ vertices never decreases its matching number. The complete $k$-graph on $sk+k-1$ vertices has…
A well known result states that stability criterion for matchings in two-sided markets doesn't ensure uniqueness. This opens the door for a moral question with regard to the optimal stable matching from a social point of view. Here, a new…
We consider the problem of closeness of solutions of an exact and an averaged difference equations on an infinite interval. Appropriate assertions are derived from one special theorem on the stability under constantly acting perturbations.
We prove an asymptotically tight lower bound on the average size of independent sets in a triangle-free graph on $n$ vertices with maximum degree $d$, showing that an independent set drawn uniformly at random from such a graph has expected…
Variational stability, in the sense of local good behavior of optimal values and solutions in problems of optimization under shifts in parameters, is important not only for validating model robustness in practical applications but also for…
We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for more than half of the graphs, and very close lower and upper…
One theorem of Nemhauser and Trotter ensures that, under certain conditions, a stable set of a graph G can be enlarged to a maximum stable set of this graph. For example, any stable set consisting of only simplicial vertices is contained in…
We determine the maximum number of edges of an $n$-vertex graph $G$ with the property that none of its $r$-cliques intersects a fixed set $M\subset V(G)$. For $(r-1)|M|\ge n$, the $(r-1)$-partite Turan graph turns out to be the unique…
In this work, we give sufficient conditions for the almost global asymptotic stability of a cascade in which the subsystems are only almost globally asymptotically stable. The result is extended to upper triangular systems of arbitrary…