An analytic approach to stability

DOI10.1016/j.disc.2010.07.002zbMath1208.05059arXiv0812.0214OpenAlexW2102457418MaRDI QIDQ710597

Oleg Pikhurko

Publication date: 19 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

stability propertygraph limitsTurán problemErdős-Simonovits stability theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Stability from graph symmetrisation arguments with applications to inducibility, Graph limits and hereditary properties, On Turán numbers for disconnected hypergraphs, A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth, Hierarchy theorems for property testing, Limits of randomly grown graph sequences, Small-world networks of Kuramoto oscillators, Hierarchy Theorems for Property Testing, Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs, An analytic approach to stability, Tight bounds on the coefficients of partition functions via stability, Stability of the Potential Function, Minimizing the number of 5-cycles in graphs with given edge-density

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A measure-theoretic approach to the theory of dense hypergraphs
• An analytic approach to stability
• Limits of dense graph sequences
• Szemerédi's lemma for the analyst
• A new generalization of Mantel's theorem to \(k\)-graphs
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Every minor-closed property of sparse graphs is testable
• Quick approximation to matrices and applications
• Spectral analysis of a nonself-adjoint differential operator
• Recurrence of distributional limits of finite planar graphs
• Moments of two-variable functions and the uniqueness of graph limits
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• Graph limits and parameter testing
• Maximizing the number of q -colorings
• Property testing and its connection to learning and approximation
• Reflection positivity, rank connectivity, and homomorphism of graphs
• On the Minimal Density of Triangles in Graphs
• Graph limits and exchangeable random graphs
• Hierarchy Theorems for Property Testing
• Very large graphs
• Anti-Ramsey numbers of doubly edge-critical graphs
• On Representatives of Subsets
• Maximum number of colorings of (2k, k²)‐graphs
• Flag algebras