Properly t-intersecting partition conjecture
Statement
Let be the set of all integer partitions of . Two partitions -intersect properly if they have distinct common parts, and a subset is properly -intersecting if every two of its members -intersect properly. Let denote the set of partitions containing each of as a part. The properly -intersecting partition conjecture. is a properly -intersecting subset of of maximum size. This is the distinct-common-parts analogue of the preceding conjectures; the source presents the unrestricted-length assertion without a resolution.
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.