Highly element-connected orientation
Statement
Is it true that if an undirected graph G with terminal set T is 2k-element-connected, then it has a k-element-connected orientation?
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.