On the order of countable graphs

DOI10.1016/S0195-6698(03)00064-7zbMath1030.03028arXivmath/0404319MaRDI QIDQ1404996

Saharon Shelah, Jaroslav Nešetřil

Publication date: 25 August 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0404319

zbMATH Keywords

Density; Partially ordered sets; Rigid graphs; Universal graphs

Mathematics Subject Classification ID

06A07: Combinatorics of partially ordered sets

05C15: Coloring of graphs and hypergraphs

03C50: Models with special properties (saturated, rigid, etc.)

03C98: Applications of model theory

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

03C64: Model theory of ordered structures; o-minimality