Related papers: Stability for large forbidden subgraphs

Using a $Z_q$-generalization of a theorem of Ky Fan, we extend to Kneser hypergraphs a theorem of Simonyi and Tardos that ensures the existence of multicolored complete bipartite graphs in any proper coloring of a Kneser graph. It allows to…

We give an algebraic proof of properness of moduli stacks of gauged maps satisfying a stability conditition introduced by Mundet and Schmitt. The proof combines a git construction of Schmitt, properness for twisted stable maps by…

We show cocycle stability for linear maps with a weak irreducibility condition and their jointly integrable perturbations.

We prove a variant of the multidimensional polynomial Szemer\'edi theorem of Bergelson and Leibman where one replaces polynomial sequences with other sparse sequences defined by functions that belong to some Hardy field and satisfy certain…

What does an Erdos-Renyi graph look like when a rare event happens? This paper answers this question when p is fixed and n tends to infinity by establishing a large deviation principle under an appropriate topology. The formulation and…

We establish a logarithmic stability inequality for the inverse problem of determining the non linear term, appearing in a semilinear BVP, from the corresponding Dirichlet-to-Neumann map (abbreviated to DtN map in the rest of this text).…

Extending the work of Liu--Mubayi--Reiher~\cite{LMR23unif} on hypergraph Tur\'{a}n problems, we introduce the notion of vertex-extendability for general extremal problems on hypergraphs and develop an axiomatized framework for proving…

We give a rigorous proof for the linear stability of the Skyrmion. In addition, we provide new proofs for the existence of the Skyrmion and the GGMT bound.

We prove a general homological stability theorem for certain families of groups equipped with product maps, followed by two theorems of a new kind that give information about the last two homology groups outside the stable range. (These…

We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…

This paper provides sufficient conditions for global asymptotic stability and global exponential stability, which can be applied to nonlinear, large-scale, uncertain discrete-time systems. The conditions are derived by means of vector…

In 1977, Erd\H{o}s and Hajnal made the conjecture that, for every graph $H$, there exists $c>0$ such that every $H$-free graph $G$ has a clique or stable set of size at least $|G|^c$; and they proved that this is true with $ |G|^c$ replaced…

We prove that the elliptic Harnack inequality (on a manifold, graph, or suitably regular metric measure space) is stable under bounded perturbations, as well as rough isometries.

We study families $\mathcal{F}\subseteq 2^{[n]}$ with restricted intersections and prove a conjecture of Snevily in a stronger form for large $n$. We also obtain stability results for Kleitman's isodiametric inequality and families with…

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…

In recent years several classical results in extremal graph theory have been improved in a uniform way and their proofs have been simplified and streamlined. These results include a new Erd\H{o}s-Stone-Bollob\'as theorem, several stability…

In this note, we give sufficient conditions for the almost sure and the convergence in $\mathbb{L}^p$ of a $U$-statistic of order $m$ built on a strictly stationary but not necessarily ergodic sequence.

We introduce the notion of a logarithmic stable map from a minimal log prestable curve to a log twisted semi-stable variety of form $xy=0$. We study the compactification of the moduli spaces of such maps and provide a perfect obstruction…

The problem of homological stability helps us to catch the structure of group homology. We calculate homological stability of special orthogonal groups, and we also calculate the stability of orthogonal groups with determinant-twisted…

Consider a graph $G$ with a path $P$ of order $n$. What conditions force $G$ to also have a long induced path? As complete bipartite graphs have long paths but no long induced paths, a natural restriction is to forbid some fixed complete…