Meshkat–Sullivant's collapsed-graph conjecture for expected dimension
Statement
Let be a graph with vertices, edges, and an exchange with . The collapsed graph is obtained by identifying vertices and . Assume that has edges with an exchange. Meshkat–Sullivant's conjecture. The graph has the expected dimension if and only if has the expected dimension. This conjecture relates expected dimension under collapsing an exchange and is presented as an extension of preceding results on graph constructions; its resolution is not specified in the source.
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.