The crown-subgraph conjecture for representation numbers of bipartite graphs
Statement
Let be a bipartite graph. For , let be a largest induced crown graph in , and let denote the representation number of .
Crown-subgraph conjecture. The representation number of equals either
or
This conjecture proposes that the representation number is determined, up to the two displayed possibilities, by the largest induced crown graph in . The source presents it in the conclusion and gives no evidence of a resolution.
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.