Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders.

DOI10.1007/S11083-014-9317-9MaRDI QIDQ2264117zbMATH OpenOpenAlexFDO

Authors Miloš S. Kurilić, Boriša Kuzeljević

Publication date 20 March 2015

Published in Order (Search for Journal in Brave)

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

zbMATH Keywords

compact setsisomorphic substructuresmaximal chainsorder typesultrahomogeneous partial orders

Mathematics Subject Classification ID

Ordinal and cardinal numbers (03E10) Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07)

Abstract: We investigate the poset (P(X),subset), where P(X) is the set of isomorphic suborders of a countable ultrahomogeneous partial order X. For X different from (resp. equal to) a countable antichain the order types of maximal chains in (P(X)cup {emptyset },subset) are characterized as the order types of compact (resp. compact and nowhere dense) sets of reals having the minimum non-isolated.

Recommendations

• Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs
• Maximal chains of isomorphic subgraphs of the Rado graph
• Uncountable Homogeneous Partial Orders
• Isomorphic and strongly connected components
• Countable homogeneous linearly ordered posets

Cites work

• Countable homogeneous partially ordered sets
• Forcing by non-scattered sets
• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• Maximal chains in atomic Boolean algebras
• Maximal chains in interval algebras
• Maximal chains in positive subfamilies of P( )
• Maximal chains of copies of the rational line
• Posets of copies of countable scattered linear orders
• Posets, homomorphisms and homogeneity
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• Towers and maximal chains in Boolean algebras

Cited in

(11)

• Antichains of copies of ultrahomogeneous structures
• Positive families and Boolean chains of copies of ultrahomogeneous structures
• Isomorphic and strongly connected components
• Maximal chains of copies of the rational line
• Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs
• On the structure of random hypergraphs
• Maximal antichains of isomorphic subgraphs of the Rado graph
• Forcing with copies of the Rado and Henson graphs
• Maximal chains in \(^ \omega \omega\) and ultrapowers of the integers
• Maximal chains of copies of freely generated ultrahomogeneous digraphs
• Maximal chains in positive subfamilies of P( )

This page was built for publication: Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264117)