Results We consider two related open problems of Erdős on block designs.
Statement
Results We consider two related open problems of Erdős on block designs. Is it true that for every fixed positive constant c < 1 there is a finite constant C = C(c) so that the following holds. Is there an absolute constant c > 0 so that for all 1/2 large n there are at least ecn log n sequences that are block-compatible for n ? The report passage is retained verbatim as the relevant context for this extracted problem.
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.