Erdős Problem #117 — Let h(n) be minimal such that any group G with the property that any subset of >n elements contains some x≠ y such that xy=yx can be covered by at most h(n) many Abelian subgroups.
Statement
Let be minimal such that any group with the property that any subset of elements contains some such that can be covered by at most many Abelian subgroups. Estimate as well as possible.
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.