Skip to main content
edited body
Source Link
Glorfindel
  • 2.8k
  • 6
  • 28
  • 38

There is a paper P. Frankl and A. M. Odlyzko. "On subsets with cardinalities of intersections divisible by a fixed integer." European Journal of Combinatorics 4(3) (1983): 215–220, in which they provide an example of l-town on $(cl)^{[n/(4l)]}$ members for every (not nessesarilynecessarily prime) integer $l$ and an ansoluteabsolute constant $c$.

In the asymptotics this gives $2^{\frac{cn \ln l}{l}}$ which beats $2^{n/l}$.

There is a paper P. Frankl and A. M. Odlyzko. "On subsets with cardinalities of intersections divisible by a fixed integer." European Journal of Combinatorics 4(3) (1983): 215–220, in which they provide an example of l-town on $(cl)^{[n/(4l)]}$ members for every (not nessesarily prime) integer $l$ and an ansolute constant $c$.

In the asymptotics this gives $2^{\frac{cn \ln l}{l}}$ which beats $2^{n/l}$.

There is a paper P. Frankl and A. M. Odlyzko. "On subsets with cardinalities of intersections divisible by a fixed integer." European Journal of Combinatorics 4(3) (1983): 215–220, in which they provide an example of l-town on $(cl)^{[n/(4l)]}$ members for every (not necessarily prime) integer $l$ and an absolute constant $c$.

In the asymptotics this gives $2^{\frac{cn \ln l}{l}}$ which beats $2^{n/l}$.

Source Link

There is a paper P. Frankl and A. M. Odlyzko. "On subsets with cardinalities of intersections divisible by a fixed integer." European Journal of Combinatorics 4(3) (1983): 215–220, in which they provide an example of l-town on $(cl)^{[n/(4l)]}$ members for every (not nessesarily prime) integer $l$ and an ansolute constant $c$.

In the asymptotics this gives $2^{\frac{cn \ln l}{l}}$ which beats $2^{n/l}$.