Conjectures: every Latin square of order n has a partial transversal of size n-1 and, if n is odd, a transversal; and every properly n-edge-colored bipartite multigraph with…
Statement
Conjectures: every Latin square of order n has a partial transversal of size n-1 and, if n is odd, a transversal; and every properly n-edge-colored bipartite multigraph with at least n+1 edges of each color has a rainbow matching using every color.
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.