✦ LIBER ✦

Constructive Upper Bounds for Intersecting Set Systems

✍ Scribed by Vince Grolmusz

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 245 KB
Volume: 7
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00223-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for sets

✍ Gang Yu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 134 KB

Intersection Statements for Systems of S

Intersection Statements for Systems of Sets

✍ W.A Deuber; P Erdős; D.S Gunderson; A.V Kostochka; A.G Meyer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 320 KB

A family of r sets is called a 2-system if any two sets have the same intersection. Denote by F(n, r) the most number of subsets of an n-element set which do not contain a 2-system consisting of r sets. Constructive new lower bounds for F(n, r) are given which improve known probabilistic results, an

An intersection theorem for systems of s

An intersection theorem for systems of sets

✍ A. V. Kostochka 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB 👁 2 views

Erdos and Rado defined a A-system, as a family in which every two members have the same intersection. Here we obtain a new upper bound on the maximum cardinality q ( n , q ) of an n-uniform family not containing any A-system of cardinality q. Namely, we prove that, for any a > 1 and q , there exists

A New Upper Bound for B2[2] Sets

✍ Alain Plagne 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 94 KB

An Upper-Bound theorem for families of c

An Upper-Bound theorem for families of convex sets

✍ Jürgen Eckhoff 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 470 KB

Upper bounds for p-divisibility of sets

Upper bounds for p-divisibility of sets of Bernoulli numbers

✍ Stephen V Ullom 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 197 KB