The extremal representation conjecture for graphs
Statement
Let be a connected graph of order , and let a representation of mean a graph representation in the sense of the paper. The extremal representation conjecture. The number of representations of a graph of order is maximized by the balanced complete bipartite graph of order . This asks for the maximum possible number of representations among connected graphs of fixed order and identifies the balanced complete bipartite graph as an extremal graph; the conjecture is posed as an open problem for future research.
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.