A remark on the stability of saturated generic graphs
From MaRDI portal
Publication:2583065
The author deals with saturated generic graphs. He shows that any such graph which satisfies some additional property is stable or \(\omega\)-stable. As a Corollary he obtains that any saturated generic pseudo-plane is strictly stable or \(\omega\)-stable.
Recommendations
- A note on stability of graphs
- scientific article; zbMATH DE number 4063144
- scientific article; zbMATH DE number 4075101
- A Gallai’s Theorem type result for the edge stability of graphs
- A note on stability for maximal \(F\)-free graphs
- A note on the Erdős-Hajnal property for stable graphs
- On the stable degree of graphs
- scientific article; zbMATH DE number 1842283
- A graph-theoretic generalization of the Sauer-Shelah lemma
- A stability result for girth‐regular graphs with even girth
Cited in
(8)- On \(n\)-saturated closed graphs
- The theories of Baldwin-Shi hypergraphs and their atomic models
- Strict superstablity and decidability of certain generic graphs
- The metamathematics of random graphs
- A simpler axiomatization of the Shelah-Spencer almost sure theories
- Superstable graphs
- A note on stability spectrum of generic structures
- Ab initio generic structures which are superstable but not -stable
This page was built for publication: A remark on the stability of saturated generic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583065)