Smooth well-balanced orientations with prescribed in-degrees
Statement
Let be an undirected graph, and a set of nodes of odd degree. When does an orientation of exist which is i) smooth (the in-degree and out-degree of every node differ by at most one), ii) well-balanced (that is for every , where is the local edge-connectivity), and iii) the in-degree is less than the out-degree at the nodes in ?
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.