✦ LIBER ✦

Families of arcs disconnected by finite sets II

✍ Scribed by M. Rochowski

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 653 KB
Volume: 78
Category: Article
ISSN: 0025-584X
DOI: 10.1002/mana.19770780106

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Families of arcs disconnected by finite

Families of arcs disconnected by finite sets I

✍ M. Rochowski 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

By M. ROCHOWSKI of Katowice (Eingegangen am 5 . 12. 1973) 1. Introduction. I n this paper a generalization (theorem C,) of theorem Ci proved in [3] shall be formulated and as a consequence of it we prove MENOER'S n-Beinsatz (see [l], [2], [4]). The proof of theorem C, shall be published separately i

Families of arcs disconnected by a point

✍ M. Rochowski 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB

Maximal intersection critical families o

Maximal intersection critical families of finite sets

✍ N.Zagaglia Salvi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 129 KB

A finite family of pairwise intersecting r-sets is a maximal r-clique if it cannot be extended to another r-clique by adding a new r-set. It is intersection critical if it is not possible to replace any edge by some of its proper subsets, without violating the intersection property. We prove that i

Arrow relations on families of finite se

Arrow relations on families of finite sets

✍ Mika Watanabe 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 856 KB

Watanabe, M., Arrow relations on families of finite sets, Discrete Mathematics 94 (1991) 53-64. Let n, m and k be positive integers. Let X be a set of cardinality n, and let 9 be a family of subsets of X. We write (n, m)-, (n -1, mk), when for all 9 with (S( em, there exists an element x of X such t

Effective Enumerations of Families of Fi

Effective Enumerations of Families of Finite Sets of Natural Numbers

✍ Angel V. Ditchev 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB

We construct a universal r.e. set in the following manner: For any (n, x) we construct a set Un,, E 8 such that the set of all (z, n, x ) such that z E U,,,, is r.e. We construct the set Un,x by steps, and on step s we build a finite approximation U,,.x,s of U,,,,, and finally we take Let us describ

Families of Finite Sets in which No Inte

Families of Finite Sets in which No Intersection of ℓ Sets Is Covered by the Union of s Others

✍ A. D'yachkov; P. Vilenkin; D. Torney; A. Macula 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 216 KB

In 1964, Kautz and Singleton (IEEE Trans. Inform. Theory 10 (1964), 363-377) introduced the superimposed code concept. A binary superimposed code of strength s is identified by the incidence matrix of a family of finite sets in which no set is covered by the union of s others (