ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph of order nn, and let a representation of GG mean a graph representation in the sense of the paper. The extremal representation conjecture. The number of representations of a graph of order nn is maximized by the balanced complete bipartite graph of order nn. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.