Erdős Problem #1025 — Independent sets for functions on pairs
Statement
For every pair of distinct elements of an -element set, choose different from both. Call a subset independent if it never contains , and together. If is the minimum, over all such functions , of the largest independent-subset size, determine the order of . In particular, improve .
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.