相关论文: Stability for large forbidden subgraphs

We prove an extension of the Regularity Lemma with vertex and edge weights which can be applied for a large class of graphs. The applications involve random graphs and a weighted version of the Erd\H{o}s-Stone theorem. We also provide means…

We prove that every class of graphs $\mathscr C$ that is monadically stable and has bounded twin-width can be transduced from some class with bounded sparse twin-width. This generalizes analogous results for classes of bounded linear…

We present a new sufficient condition on stability number and toughness of the graph to have an f-factor.

We present a sufficient condition for the stability property of extremal graph problems that can be solved via Zykov's symmetrisation. Our criterion is stated in terms of an analytic limit version of the problem. We show that, for example,…

We prove a stability theorem for spaces of smooth concordance embeddings. From it we derive various applications to spaces of concordance diffeomorphisms and homeomorphisms.

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…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

This work establishes rigorous, novel and widely applicable stability guarantees and transferability bounds for graph convolutional networks -- without reference to any underlying limit object or statistical distribution. Crucially,…

The stability number of a graph G is the cardinality of a stability system of G (that is of a stable set of maximum size of G). A graph is alpha-stable if its stability number remains the same upon both the deletion and the addition of any…

The Erd\H{o}s-Gallai Theorem states that every graph of average degree more than $l-2$ contains a path of order $l$ for $l\ge 2$. In this paper, we obtain a stability version of the Erd\H{o}s-Gallai Theorem in terms of minimum degree. Let…

We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and improve the earlier results of Rodl, Erdos-Hajnal, Promel-Rodl, Nikiforov, Chung-Graham, and…

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…

We study a stability property of probability laws with respect to small violations of algorithmic randomness. A sufficient condition of stability is presented in terms of Schnorr tests of algorithmic randomness. Most probability laws, like…

We develop local stable group theory directly from topological dynamics, and extend the main results in this subject to the setting of stability "in a model". Specifically, given a group $G$, we analyze the structure of sets $A\subseteq G$…

We give a sharp spectral condition for the existence of odd cycles in a graph of given order. We also prove a related stability result.

The paper investigates the stability properties of restrictions of irreducible representations of the symmetric group to the hyperoctahedral subgroup. A stability result is obtained, analogous to the classical Murnaghan theorem on the…

We show that a sufficiently large graph of bounded degree can be decomposed into quasi-homogeneous pieces. The result can be viewed as a "finitarization" of the classical Farrell-Varadarajan Ergodic Decomposition Theorem.

We prove a stability theorem for the elliptic Harnack inequality: if two weighted graphs are equivalent, then the elliptic Harnack inequality holds for harmonic functions with respect to one of the graphs if and only if it holds for…

We outline some recent proofs of quantum ergodicity on large graphs and give new applications in the context of irregular graphs. We also discuss some remaining questions.

This is a short expository account of the regularity lemma for stable graphs proved by the authors, with some comments on the model theoretic context, written for a general logical audience.