Morris's asymptotic conjecture for FC-family thresholds

For integers k2k\geqslant 2 and nn, let FC(k,n)FC(k,n) denote the threshold quantity for kk-uniform families on an nn-element ground set as defined in the paper, and let Θ\Theta have its usual asymptotic meaning. Morris's asymptotic conjecture.

FC(k,n)=Θ(nk2)FC(k,n)=\Theta(n^{k-2})

for all k2k\geqslant 2. This is presented among the paper's open conjectures and predicts the asymptotic order of the threshold for every uniformity.

Sources & referencesView supporting material

Primary source

Robert Morris, “FC-families, and improved bounds for Frankl's Conjecture”, arXiv:math/0702348 (2007).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.