English

Uniform sets in a family with restricted intersections

Combinatorics 2018-11-29 v1

Abstract

Let F\mathcal{F} be a family of subsets of [n]={1,,n}[n]=\{1,\ldots,n\} and let LL be a set of nonnegative integers. The family F\mathcal{F} is \emph{LL-intersecting} if FFL|F\cap F'|\in L for every two distinct members F,FFF,F'\in\mathcal{F}; and F\mathcal{F} is kk-uniform if all its members have the same size kk. A large variety of problems and results in extremal set theory concern on kk-uniform LL-intersecting families. Many attentions are paid to finding the maximum size of a family among all kk-uniform LL-intersecting families with prescribed n,kn,k and LL. In this paper, from another point of view, we propose and investigate the problem of estimating the maximum size of a member in a family among all uniform LL-intersecting families with size mm, here n,mn,m and LL are prescribed. Our results aim to find out more precise relations of n,m,kn,m,k and LL.

Keywords

Cite

@article{arxiv.1811.11533,
  title  = {Uniform sets in a family with restricted intersections},
  author = {Yandong Bai and Binlong Li and Jiuqiang Liu and Shenggui Zhang},
  journal= {arXiv preprint arXiv:1811.11533},
  year   = {2018}
}

Comments

18 pages

R2 v1 2026-06-23T06:23:27.986Z