ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on n−1n-1 vertices, and let k→lk\to l be an edge in GG. Construct a graph G′G' on nn vertices by subdividing the edge k→lk\to l: add vertex nn and replace the edge k→lk\to l by the two edges k→nk\to n and n→ln\to l. Edge-subdivision conjecture. If GG has the expected dimension, then G′G' 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 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.