Universal graphs with forbidden subgraphs and algebraic closure (Q1293133): Difference between revisions

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.