Stability for large forbidden subgraphs
Vladimir Nikiforov
TL;DR
This paper generalizes the classical stability theorem to include larger forbidden subgraphs of logarithmic size, expanding the understanding of graph stability conditions.
Contribution
It introduces an extension of the stability theorem applicable to larger forbidden subgraphs of logarithmic order, broadening the scope of classical results.
Findings
Extended stability theorem for larger forbidden subgraphs
Applicable to graphs with forbidden subgraphs of logarithmic size
Provides new insights into graph stability conditions
Abstract
We extend the classical stability theorem of Erdos and Simonovits for forbidden graphs of logarithmic order.
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.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research