Skip to main content
Log in

Embedding Structures

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 For any quasiordered set (`quoset') or topological space S, the set Sub S of all nonempty subquosets or subspaces is quasiordered by embeddability. Given any cardinal number n, denote by p n and q n the smallest size of spaces S such that each poset, respectively, quoset with n points is embeddable in Sub S. For finite n, we prove the inequalities n + 1 ≤p n q n p n + l(n) + l(l(n)), where l(n) = min{k∈ℕ∣n≤2k}. For the smallest size b n of spaces S so that Sub S contains a principal filter isomorphic to the power set ?(n), we show n + l(n) − 1 ≤b n n + l(n) + l(l(n))+2. Since p n b n , we thus improve recent results of McCluskey and McMaster who obtained p n n 2. For infinite n, we obtain the equation b n = p n = q n = n.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: April 19, 1999 Final version received: February 21, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Erné, M., Reinhold, J. Embedding Structures. Graphs Comb 17, 637–645 (2001). https://doi.org/10.1007/PL00007255

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00007255

Navigation