Universal graphs with forbidden subgraphs and algebraic closure (Q1293133)

From MaRDI portal
Revision as of 02:49, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Universal graphs with forbidden subgraphs and algebraic closure
scientific article

    Statements

    Universal graphs with forbidden subgraphs and algebraic closure (English)
    0 references
    0 references
    0 references
    0 references
    28 June 1999
    0 references
    The authors investigate the problem of existence of countable universal graphs with finitely many forbidden subgraphs. They use model-theoretic notions to obtain their results. So they work with existentially closed models and investigate the growth rate of the algebraic closure of finite sets. In the first half of the paper they provide the model-theoretic notions and methods which they need for their investigations. In the second half these methods are applied. Many proofs for known examples are simplified. Further on they give many new examples of universal graphs omitting a finite set of connected finite graphs.
    0 references
    0 references
    model completeness
    0 references
    existential completeness
    0 references
    existence of countable universal graphs
    0 references
    finitely many forbidden subgraphs
    0 references
    existentially closed models
    0 references
    growth rate of the algebraic closure of finite sets
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references