Morris's asymptotic conjecture: FC(k,n)=Θ_k(n^k-2)
Statement
Morris's Conjecture 2 asks whether, for every fixed integer , as . Here is the least such that every collection of distinct -subsets of an -point set is Frankl-complete. A configuration with support is Frankl-complete if every finite union-closed family has an element of belonging to at least half its sets. The extension may contain additional points.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.