✦ LIBER ✦

On the density of families of sets

✍ Scribed by N Sauer

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 133 KB
Volume: 13
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(72)90019-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On families of intersecting sets

✍ Andrzej Ehrenfeucht; Jan Mycielski 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 81 KB

A theorem on families of sets

✍ Bernt Lindström 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 171 KB

On the density of sets of vectors

✍ Noga Alon 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 143 KB

Answering a question of Erd6s, Sauer [4] and indepe~dently Pcrles and Shelah [5] found the maximal cardinality of a collection ~ of subsets of a se~: N of cardinality n such that for ever/ subset M ~ N of cardinality m I{C f3 M: C ~ 3b'}l < 2". Karl~)vsky and Milman [3] generalised this result. Here

On the density of sets of divisors

✍ R.E.L. Aldred; R.P. Anstee 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 214 KB

Consider the lattice of divisors of n, [1, n]. For any downset (ideal) J in [1, n] we get a forbidden configuration theorem of the type that if a set of divisors D avoids certain configurations, then ] D ] ~< I J ]. If we let 5 ¢ be the set of minimal elements of [ 1, n] not in J, then we forbid in

Some results on the complexity of famili

Some results on the complexity of families of sets

✍ Daniel Grieser 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 872 KB

Grieser, D., Some results on the complexity of families of sets, Discrete Mathematics 88 (1991) 179-192. Let 'Y be a property of graphs on a fixed n-element vertex set V. The complexity c(P) is the minimal number of edges whose existence in a previously unknown graph H has to be tested such that it

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