The complete bipartite rook equivalence graph conjecture for Ferrers boards
Statement
Let be a complete bipartite graph, and let be a Ferrers board whose rook equivalence graph is . Complete bipartite rook equivalence conjecture. Then . This conjecture concerns which graphs can arise as rook equivalence graphs of Ferrers boards; the paper presents it as a future project, and no resolution is supplied here.
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.