ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Morris's Conjecture 2 asks whether, for every fixed integer k≥2k\ge2, FC(k,n)=Θk(nk−2)\mathrm{FC}(k,n)=\Theta_k(n^{k-2}) as n→∞n\to\infty. Here FC(k,n)\mathrm{FC}(k,n) is the least mm such that every collection of mm distinct kk-subsets of an nn-point set is Frankl-complete. A configuration G\mathcal G with support U=⋃GU=\bigcup\mathcal G is Frankl-complete if every finite union-closed family F⊇G\mathcal F\supseteq\mathcal G has an element of UU belonging to at least half its sets. The extension may contain additional points.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.