✦ LIBER ✦

The identification of a set by successive intersections

✍ Scribed by Arthur Gill; Doron Gottlieb

Book ID: 114037032
Publisher: Elsevier Science
Year: 1974
Weight: 483 KB
Volume: 24
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(74)80020-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The minimal number of lines intersected

The minimal number of lines intersected by a set of q + 2 points, blocking sets, and intersecting circles

✍ A Blokhuis; A.A Bruen 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Maximum Hitting of a Set by Compressed I

Maximum Hitting of a Set by Compressed Intersecting Families

✍ Peter Borg 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 212 KB

The intersection of solution sets

✍ C. WINSTON SMITH, JR. 📂 Article 📅 1967 🏛 National Council of Teachers of Mathematics ⚖ 339 KB

Finding an element in a set by the succe

Finding an element in a set by the successive relaxation method

✍ I. V. Konnov 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 259 KB

Metric dimension of the intersections of

Metric dimension of the intersections of a point set with hyperplanes

✍ Tatsuo Goto 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 519 KB

In this paper we improve the construction of Goto (1993) to obtain the Main Theorem: Let n, m and k be arbitrary integers such that 0 < m < n -1 3 1 and m < k < min{2m, n -1). Then there exists a point set Xk,, in Euclidean n-space IR" such that (i) pdimX& = m and dimXk,, = k, (ii) pdim(X& n H) = m

The intersection graph of random sets

✍ Hiroshi Maehara 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 369 KB

Maehara, H., The intersection graph of random sets, Discrete Mathematics 87 (1991) 97-104. Let X,, i=l,..., n, be n = n(N) independent random subsets of {1,2,. . , N}, each selected at random out of the 2N subsets. We present some asymptotic (N-tm) properties of {Xi}, e.g. if r~/2~'~--+ m then {Xi}