Dimension bound and equality characterization for binary graphical descriptions
Statement
Fix a tuple of graphs on vertex set , and let be the set described by this tuple. Assume that the tuple is a valid graphical description, so each is a disjoint union of complete bipartite graphs. Graphical-description dimension conjecture. Then
with equality only if . This proposed bound would constrain the expected dimensions of all valid graphical-description varieties and would identify the only possible equality value of the number of summands.
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.