Strong forms of stability from flag algebra calculations

DOI10.1016/j.jctb.2018.08.001zbMath1404.05090arXiv1706.02612OpenAlexW2963113629MaRDI QIDQ1719577

Oleg Pikhurko, Konstantinos Tyros, Jakub Sliačan

Publication date: 8 February 2019

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.02612

zbMATH Keywords

stabilityedit distanceflag algebrassubgraph count

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items

Maximum number of almost similar triangles in the plane, Stability results for graphs with a critical edge, C5 ${C}_{5}$ is almost a fractalizer, Stability from graph symmetrisation arguments with applications to inducibility, Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm, Asymptotic Structure for the Clique Density Theorem, Minimizing the number of 5-cycles in graphs with given edge-density

Uses Software

• Flagmatic

Cites Work

• Turán number of generalized triangles
• The inducibility of blow-up graphs
• Measurable events indexed by products of trees
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• On the maximum number of five-cycles in a triangle-free graph
• A problem of Erdős on the minimum number of \(k\)-cliques
• On a theorem of Rademacher-Turán
• Supersaturated graphs and hypergraphs
• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• The maximal number of induced complete bipartite graphs
• On the number of \(C_ 5's\) in a triangle-free graph
• The inducibility of graphs
• Stability results for graphs with a critical edge
• Pentagons in triangle-free graphs
• Turán numbers of extensions
• The maximal number of induced \(r\)-partite subgraphs
• On the number of pentagons in triangle-free graphs
• On the Minimum Number of k-Cliques in Graphs with Restricted Independence Number
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• On Sets of Acquaintances and Strangers at any Party
• On the Local Profiles of Trees
• Blue-Empty Chromatic Graphs
• The inducibility of complete bipartite graphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Undecidability of linear inequalities in graph homomorphism densities
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• The Inducibility of Graphs on Four Vertices
• Flag algebras
• On the inducibility of cycles
• Efficient testing of large graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item