Kelmans–Seymour conjecture
Statement
Let be a finite simple graph. Say that is -connected if and, for every set with , the graph is connected. Say that contains a subdivision of if there exist five distinct vertices (the branch vertices) and ten paths in , one for each pair , such that has endpoints and , and any two of these paths meet only in the branch vertices that are common endpoints of the two paths; equivalently, has a subgraph obtained from by replacing each edge with an internally disjoint path of length at least .
Then every -connected graph that is not planar contains a subdivision of .
Record
- 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.