ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A pairwise balanced design for {1,…,n}\{1,\ldots,n\} is a collection of sets A1,…,Am⊆{1,…,n}A_1,\ldots,A_m\subseteq \{1,\ldots,n\} such that 2≤∣Ai∣<n2\leq \lvert A_i\rvert <n and every pair of distinct elements x,y∈{1,…,n}x,y\in \{1,\ldots,n\} is contained in exactly one AiA_i. Is there a constant C>0C>0 and, for all large nn, a pairwise balanced design such that ∣Ai∣>n1/2−C\lvert A_i\rvert > n^{1/2}-C for all 1≤i≤m1\leq i\leq m?

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.