𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The finite cutset property

✍ Scribed by J.-M. Brochet


Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
388 KB
Volume
39
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

A cutset of H is a subset of βˆͺ H which meets every element of H. H has the finite cutset property if every cutset of H contains a finite one. We study this notion, and in particular how it is related to the compactness of H for the natural topology. MSC: 04A20, 54D30.


πŸ“œ SIMILAR VOLUMES


Extensions of ordered sets having the fi
✍ John Ginsburg πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 892 KB

Let P be an ordered set. P is said to have the finite cutset property if for every x in P there is a finite set F of elements which are noncomparable to x such that every maximal chain in P meets {x} t.J F. It is well known that this property is equivalent to the space of maximal chains of P being c

Semicomplemented Lattices and the Finite
✍ I. L. Humberstone; A. J. Lock πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 502 KB

If the Liikasiewicz many-valued systems are treated as logics in the senst of the following section, to whirh a sequent belongs wlien every assignment of trut,h-ralues giving a deliignakcd value to every formnla on the left of the "I-" gives a designated value to the formula on the right, then these

On finite groups with the cayley isomorp
✍ Li, Cai Heng; Praeger, Cheryl E.; Xu, Ming Yao πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 197 KB

Let G be a finite group, and let Cay(G, S) be a Cayley digraph of G. If, for all T βŠ‚ G, Cay(G, S) ∼ = Cay(G, T ) implies S Ξ± = T for some Ξ± ∈ Aut(G), then Cay(G, S) is called a CI-graph of G. For a group G, if all Cayley digraphs of valency m are CI-graphs, then G is said to have the m-DCI property;