Compact compatible topologies for posets and graphs (Q1272943)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Compact compatible topologies for posets and graphs |
scientific article; zbMATH DE number 1228602
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Compact compatible topologies for posets and graphs |
scientific article; zbMATH DE number 1228602 |
Statements
Compact compatible topologies for posets and graphs (English)
0 references
2 December 1998
0 references
The connections between the theory of posets and aspects of general topology are both ancient as far as the subject is concerned and fundamental since topologies like diagrams can be used to characterize posets and their properties quite completely. This paper deals with topologies on the vertex set of the comparability graph of a poset and in particular with those (compatible) topologies such that connectedness in the topological sense correlates with connectedness in the graph theoretic sense for certain types of subsets noting that in the case of weak compatibility the structure of the comparability graph is completely determined. From the technical material special results for classes of posets including trees are derived which permit decision concerning the question of whether suitably compatible topologies exist. This useful paper follows a collection of articles of the same nature and in a sense provides a culmination of the approach outlined while still leading to research questions of interest for future work in this particular area.
0 references
cyclically bounded graph
0 references
topology
0 references
comparability graph
0 references
poset
0 references
connectedness
0 references
trees
0 references
0.9181161
0 references
0.90414023
0 references
0 references
0 references
0 references
0.88363767
0 references
0.8768754
0 references
0.8768754
0 references