Related papers: Stable sets in flag spheres
In this paper, we give lower bounds for the homology of the fibers of a map to a manifold. Using new sheaf theoretic methods, we show that these lower bounds persist over whole open sets of the manifold, and that they are stable under…
In this note we derive an upper bound for the Hausdorff dimension of the stable set of a hyperbolic set $\Lambda$ of a $C^2$ diffeomorphisms on a $n$-dimensional manifold. As a consequence we obtain that $\dim_H W^s(\Lambda)=n$ is…
An edge-weighted graph $G=(V,E)$ is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as…
It is proved that vertical graphs and radial graphs are strongly stable for a certain type of densities in Euclidean space ${\mathbb R}^{n+1}$. Particular cases of these densities include translators, expanders and singular minimal…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
$f$-vertex stability number $vs_f(G)=\min\{|X|: X\subseteq V(G) \enspace \text{and} \enspace f(G-X)\neq f(G)\}$, and $f$-edge stability number is defined similarly by setting $X\subseteq E(G)$. In this paper, for multiplicative and mining…
In this paper we study the boundedness of extension operators associated with spheres in vector spaces over finite fields.In even dimensions, we estimate the number of incidences between spheres and points in the translated set from a…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
We investigate the standard stable manifold theorem in the context of a partially hyperbolic singu-larity of a vector field depending on a parameter. We prove some estimates on the size of the neighbourhood where the local stable manifold…
We give upper bounds on the order of the automorphism group of a simple graph
We study sunflowers within the context of finitely generated substructures of ultrahomogeneous structures. In particular, we look at bounds on how large a set system is needed to guarantee the existence of sunflowers of a given size. We…
Topological point defects on orientationally ordered spheres, and on deformable fluid vesicles have been partly motivated by their potential applications in creating super-atoms with directional bonds through functionalization of the…
In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…
We improve known upper bounds for the minimal dispersion of a point set in the unit cube and its inverse in both the periodic and non-periodic settings. Some of our bounds are sharp up to logarithmic factors.
We give a bound on the spectral radius of subgraphs of regular graphs with given order and diameter. We give a lower bound on the smallest eigenvalue of a nonbipartite regular graph of given order and diameter.
For a finite simple graph $G$ we give an upper bound for the regularity of the powers of the edge ideal $I(G)$.
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…
In this paper a tight lower bound for algebraic connectivity of graphs (second smallest eigenvalue of the Laplacian matrix of the graph) based on connection-graph-stability method is introduced. The connection-graph-stability score for each…