Name
Abstract | ||
|---|---|---|
Given a hereditary family G 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,G), 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)−λ(G))(n2) adjacencies. As special cases, this property describes all almost extremal graphs of order n within o(n2) edges and shows that every extremal graph of order n⩾C is a blow-up of B. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.jctb.2018.08.001 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
Edit distance,Flag algebras,Stability,Subgraph count | Discrete mathematics,Graph,Combinatorics,Algebra,Mathematical proof,Mathematics,Computation,Lambda | Journal |
Volume | ISSN | Citations |
135 | 0095-8956 | 0 |
PageRank | References | Authors |
0.34 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oleg Pikhurko | 1 | 318 | 47.03 |
| Jakub Sliacan | 2 | 0 | 0.34 |
| Konstantinos Tyros | 3 | 6 | 2.63 |