Let D_r be the r-daisy consisting of the six r-sets A with P\subset A\subset P\cup Q for an (r-2)-set P and a disjoint 4-set Q.
Statement
Let D_r be the r-daisy consisting of the six r-sets A with P\subset A\subset P\cup Q for an (r-2)-set P and a disjoint 4-set Q. How large can a family A of r-sets from an n-set be if it contains no copy of D_r?
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.