𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Fisher type inequality

✍ Scribed by D.E. Keenan


Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
318 KB
Volume
29
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


tn this paper we study subsets of 8 finite set that intersect each other in at most one eleml~ont, Etch subaet intersects mogt of the other subsets in exwtly one element. The Mowing theorem is one of our main conduaions, tot S,, 1 . . , S,,, be m subrreta ot' an n=aet S with IS,1 22 (1~ I, 1.1, tti) and IS,nS#4 (1~1; 1, f4,a.r, m), Suppose further th;tt for Borne flxsd positive integer c each S, hcrtr non=smpty interaectian with trt le~lst m -c( of the femtiining subeta, Thctr


πŸ“œ SIMILAR VOLUMES


A Generalization of Fisher's Inequality
✍ Hunter S. Snevily πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 97 KB

In this paper we are concerned with the following conjecture. Conjecture: Let L be a collection of k positive integers and In particular, we show this conjecture is true when L consists of k consecutive positive integers. This generalizes a well-known inequality of Fisher's. Our proof simplifies an

A Note on Fisher's Inequality
✍ Douglas R. Woodall πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 226 KB

A new proof is given of the nonuniform version of Fisher's inequality, first proved by Majumdar. The proof is ``elementary,'' in the sense of being purely combinatorial and not using ideas from linear algebra. However, no nonalgebraic proof of the n-dimensional analogue of this result (Theorem 3 her

A sharpening of Fisher's inequality
✍ Peter Frankl; ZoltΓ‘n FΓΌredi πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 261 KB

on v points and b lines the number of intersecting line-pairs is at least (z). This clearly implies b 2 v.

Fisher's inequality revisited
✍ Takashi Hara; Hal Tasaki πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 165 KB
A short proof of fisher's inequality
✍ Renaud Palisse πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 71 KB

Nous donnons ici une dtmonstration nouvelle, trts courte, de I'iGgaliti de Fisher, qui gCntralise un rCsultat bien connu de de Bruijn et ErdGs. Cette dtmonstration utilise essentiellement une id&e de Tverberg (1982) pour dt-montrer un autre tnonct combinatoire. We prove the following result.