Papers › Strong Forms of Stability from Flag Algebra Calculations
Strong Forms of Stability from Flag Algebra Calculations
Oleg Pikhurko, Jakub Sliacan, Konstantinos Tyros
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Given a hereditary family 𝒢 of admissible graphs and a function λ(G) that linearly depends on the statistics of order-κ subgraphs in a graph G, we consider the extremal problem of determining λ(n,𝒢), the maximum of λ(G) over all admissible graphs G of order n. We call the problem perfectly B-stable for a graph B if there is a constant C such that every admissible graph G of order n≥C can be made into a blow-up of B by changing at most C(λ(n,𝒢)-λ(G))n2 adjacencies. As special cases, this property describes all almost extremal graphs of order n within o(n²) edges and shows that every extremal graph of order n≥n₀ is a blow-up of B. We develop general methods for establishing stability-type results from flag algebra computations and apply them to concrete examples. In fact, one of our sufficient conditions for perfect stability is stated in a way that allows automatic verification by a computer. This gives a unifying way to obtain computer-assisted proofs of many new results.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections