2017/01/03 by Xin Wang, Wang, Xin, Hengjia Wei +3
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1701.00585
arxiv created 2017/01/03 · arxiv updated 2017/01/04
Let K=\k1,k2,…,kr\ and L=\l1,l2,…,ls\ be disjoint subsets of \0,1,…,p-1\, where p is a prime and A=\A1,A2,…,Am\ be a family of subsets of [n] such that |Ai|\pmodp∈ K for all Ai∈ A and |Ai∩ Aj|\pmodp∈ L for i≠ j. In 1991, Alon, Babai and Suzuki conjectured that if n≥ s+max1≤ i≤ r ki, then |A|≤ n\choose s+n\choose s-1+⋯+n\choose s-r+1. In 2000, Qian and Ray-Chaudhuri proved the conjecture under the condition n≥ 2s-r. In 2015, Hwang and Kim verified the conjecture of Alon, Babai and Suzuki. In this paper, we will prove that if n≥ 2s-2r+1 or n≥ s+max1≤ i≤ rki, then |A|≤n-1\choose s+n-1\choose s-1+⋯+n-1\choose s-2r+1. This result strengthens the upper bound of Alon, Babai and Suzuki's conjecture when n≥ 2s-2.