Extremal set systems with restricted k-wise intersections

@article{Fredi2004ExtremalSS,
  title={Extremal set systems with restricted k-wise intersections},
  author={Zolt{\'a}n F{\"u}redi and Benny Sudakov},
  journal={J. Comb. Theory, Ser. A},
  year={2004},
  volume={105},
  pages={143-159}
}
A large variety of problems and results in Extremal Set Theory deal with estimates on the size of a family of sets with some restrictions on the intersections of its members. Notable examples of such results, among others, are the celebrated theorems of Fischer, RayChaudhuri–Wilson and Frankl–Wilson on set systems with restricted pairwise intersections. These also can be considered as estimates on binary codes with given distances. In this paper we obtain the following extension of some of… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Linear algebra methods in combinatorics

  • L. Babai, P. Frankl
  • Department of Computer Science, University of…
  • 1992
Highly Influential
10 Excerpts

On t-designs

  • D. K. Ray-Chaudhuri, R. M. Wilson
  • Osaka J. Math. 12
  • 1975
Highly Influential
8 Excerpts

On a problem of Deza and Frankl

  • Z. Füredi
  • Ars Combin. 13
  • 1982
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…