Compact Spaces and Spaces of Maximal Complete Subgraphs
From MaRDI portal
Publication:3217243
DOI10.2307/2000007zbMath0554.54009OpenAlexW4231219600MaRDI QIDQ3217243
Publication date: 1984
Full work available at URL: https://doi.org/10.2307/2000007
Related Items (22)
Extensions of ordered sets having the finite cutset property ⋮ Ladders in ordered sets ⋮ Cutsets of Boolean lattices ⋮ Antichain cutsets of strongly connected posets ⋮ Chains, antichains, and fibres ⋮ A chain decomposition theorem ⋮ Maximal chains and cutsets of an ordered set: A Menger type approach ⋮ The Menger property for infinite ordered sets ⋮ A length-width inequality for partially ordered sets with two-element cutsets ⋮ Infinite ordered sets spanned by finitely many chains ⋮ Cut-sets in infinite graphs and partial orders ⋮ Normally supercompact spaces and completely distributive posets ⋮ Search and sweep numbers of finite directed acyclic graphs ⋮ Finite antichain cutsets in posets ⋮ The PT-order, minimal cutsets and Menger property ⋮ Minimum cutsets for an element of a Boolean lattice ⋮ Compactness and subsets of ordered sets that meet all maximal chains ⋮ Antichain cutsets ⋮ On the treatment of incomparability in ordering semantics and premise semantics ⋮ Finite cutsets and finite antichains ⋮ A characterization of a topology on the countably infinite random graph ⋮ Wide posets with fixed height and cutset number
Cites Work
This page was built for publication: Compact Spaces and Spaces of Maximal Complete Subgraphs