Compact Spaces and Spaces of Maximal Complete Subgraphs

DOI10.2307/2000007zbMATH Open0554.54009OpenAlexW4231219600MaRDI QIDQ3217243FDOQ3217243

Authors: Murray G. Bell, J. Ginsburg 

Publication date: 1984

Full work available at URL: https://doi.org/10.2307/2000007

Recommendations

• scientific article; zbMATH DE number 1261783
• Publication:4861830
• The compactness of graph about complete graphs
• scientific article; zbMATH DE number 3940205
• Compactness results in extremal graph theory
• scientific article; zbMATH DE number 5178966
• scientific article; zbMATH DE number 987573
• scientific article; zbMATH DE number 3204304
• scientific article; zbMATH DE number 4017874
• Finite subset spaces of graphs and punctured surfaces

zbMATH Keywords

binary subbasespace of all maximal complete subgraphszero-dimensional supercompact spaces

Mathematics Subject Classification ID

Compactness (54D30)

Cites Work

• A Characterization of Comparability Graphs and of Interval Graphs
• Partially Ordered Sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Antichains and Finite Sets that Meet all Maximal Chains
• Title not available (Why is that?)

Cited In (22)

• A characterization of a topology on the countably infinite random graph
• Finite cutsets and finite antichains
• A chain decomposition theorem
• Infinite ordered sets spanned by finitely many chains
• Minimum cutsets for an element of a Boolean lattice
• The PT-order, minimal cutsets and Menger property
• Cut-sets in infinite graphs and partial orders
• On the treatment of incomparability in ordering semantics and premise semantics
• Cutsets of Boolean lattices
• Extensions of ordered sets having the finite cutset property
• Maximal chains and cutsets of an ordered set: A Menger type approach
• Antichain cutsets
• Normally supercompact spaces and completely distributive posets
• Compactness and subsets of ordered sets that meet all maximal chains
• Finite antichain cutsets in posets
• Antichain cutsets of strongly connected posets
• Search and sweep numbers of finite directed acyclic graphs
• Wide posets with fixed height and cutset number
• The Menger property for infinite ordered sets
• Chains, antichains, and fibres
• A length-width inequality for partially ordered sets with two-element cutsets
• Ladders in ordered sets

This page was built for publication: Compact Spaces and Spaces of Maximal Complete Subgraphs

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