Representing Embeddability as Set Inclusion

DOI10.1112/S0024610798006668zbMath0928.03050arXivmath/9507212MaRDI QIDQ4265406

Menachem Kojman

Publication date: 25 October 1999

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

representation theorempartial orderforbidden subgraphuniversal graphclub guessing sequencecomplexity of classes of graphs with forbidden countable configurationscontinuity of representationembeddability of uncountable graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Applications of set theory (03E75) Other combinatorial set theory (03E05) Graph representations (geometric and intersection representations, etc.) (05C62) Applications of model theory (03C98)

Related Items (6)

Universal graphs at the successor of a singular cardinal ⋮ On properties of theories which preclude the existence of universal models ⋮ Almost isometric embedding between metric spaces ⋮ On the existence of universal models ⋮ There is no universal countable random-free graph ⋮ Club guessing and the universal models

This page was built for publication: Representing Embeddability as Set Inclusion