ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d≥2d \geq 2. A graph is a forbidden minor for dd-flattenability when it is a minimal obstruction to dd-flattenability. For an edge ee of a graph GG, (G∖e,e)(G \setminus e,e) denotes the graph-nonedge pair obtained by deleting ee. Forbidden-minor SIP characterization. For any dimension d≥2d \geq 2, a graph GG is a forbidden minor for dd-flattenability if and only if both of the following hold: for every edge ee of GG, (G∖e,e)(G \setminus e,e) does not have the dd-SIP; and for every minor [G][G] obtained by a single edge deletion or contraction, and every edge ee of [G][G], ([G]∖e,e)([G] \setminus e,e) has the dd-SIP. This is proposed as a way to avoid relying on an explicit list of higher-dimensional forbidden minors.

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.