Kiselev–Kupavskii–Patkós minimum-degree conjecture for union antichains
Statement
Let be the power set of . A family is a -union antichain if it is an antichain and for every . Write for its minimum degree.
Kiselev–Kupavskii–Patkós' conjecture. If and is a -union antichain, then
The conjecture concerns the minimum degree of union antichains and is equivalent to their conjecture on the diversity of an intersecting antichain. Its resolution is not given in the supplied text.
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.