The edge-deletion characterization of forbidden flattenability minors
Statement
Let . A graph is a forbidden minor for -flattenability when it is a minimal obstruction to -flattenability. For an edge of a graph , denotes the graph-nonedge pair obtained by deleting . Forbidden-minor SIP characterization. For any dimension , a graph is a forbidden minor for -flattenability if and only if both of the following hold: for every edge of , does not have the -SIP; and for every minor obtained by a single edge deletion or contraction, and every edge of , has the -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.