Stability of the potential function
Catherine Erbes, Michael Ferrara, Ryan R. Martin, Paul Wenger

TL;DR
This paper explores the stability of the potential function in graph theory, defining a new stability concept, contrasting it with extremal functions, and characterizing stability for certain graph classes.
Contribution
It introduces a novel stability notion for the potential function, analyzes its properties, and provides conditions and characterizations for stability in specific graph families.
Findings
Many graph families are not $\sigma$-stable under the new definition.
A sufficient condition for stability of a graph $H$ is provided.
Graphs with an induced subgraph of order $\alpha(H)+1$ with exactly one edge are characterized for stability.
Abstract
A graphic sequence is potentially -graphic if there is some realization of that contains as a subgraph. The Erd\H{o}s-Jacobson-Lehel problem asks to determine , the minimum even integer such that any -term graphic sequence with sum at least is potentially -graphic. The parameter is known as the potential function of , and can be viewed as a degree sequence variant of the classical extremal function . Recently, Ferrara, LeSaulnier, Moffatt and Wenger [On the sum necessary to ensure that a degree sequence is potentially -graphic, Combinatorica 36 (2016), 687--702] determined asymptotically for all , which is analogous to the Erd\H{o}s-Stone-Simonovits Theorem that determines asymptotically for nonbipartite . In this paper, we investigate a stability concept…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
