The weak acyclic matching conjecture for cyclic groups of prime order
Statement
Let be an abelian group. It has the weak acyclic matching property if, for every pair of finite subsets and of with and , there is at least one acyclic matching from to .
Weak acyclic matching conjecture. There exists a prime such that does not satisfy the weak acyclic matching property.
This is a weaker property than the acyclic matching property because the condition ensures that every bijection from to is a matching. The paper notes that infinitely many prime cyclic groups fail the acyclic matching property, but whether one fails the weak version remains open.
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.