Expected-dimension conjecture for subdividing an edge in a graph
Statement
Let be a graph on vertices, and let be an edge in . Construct a graph on vertices by subdividing the edge : add vertex and replace the edge by the two edges and . Edge-subdivision conjecture. If has the expected dimension, then has the expected dimension as well. This conjecture proposes that expected dimension is preserved when an edge is subdivided; the preceding discussion gives a converse failure for a related construction, while the source does not specify a resolution of this conjecture.
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.