Stability‐type results for hereditary properties

DOI10.1002/jgt.20388zbMath1221.05067OpenAlexW4241969375MaRDI QIDQ3652542

Noga Alon, Uri Stav

Publication date: 18 December 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20388

zbMATH Keywords

hereditary propertiesextremal graph theoryedit distancestability theoremcut distance

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

The edit distance function and symmetrization ⋮ On the computation of edit distance functions ⋮ Hardness of edge-modification problems

Cites Work

• Unnamed Item
• Excluding induced subgraphs. II: Extremal graphs
• \(H\)-free graphs of large minimum degree
• The maximum edit distance from hereditary graph properties
• Edit distance and its computation
• Hardness of edge-modification problems
• Quick approximation to matrices and applications
• On the editing distance of graphs
• What is the furthest graph from a hereditary property?
• Excluding Induced Subgraphs III: A General Asymptotic
• Almost all Berge Graphs are Perfect
• Extremal subgraphs of random graphs
• The structure of hereditary properties and colourings of random graphs

This page was built for publication: Stability‐type results for hereditary properties