Highly connected graphs with no K_n minor
Statement
Problem Is it true for all , that every sufficiently large -connected graph without a minor has a set of vertices whose deletion results in a planar graph?
Record
- Source
- Added
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.