Erdős Problem #1006 — Acyclic orientations robust under reversing one edge
Statement
If a graph has girth greater than , can its edges always be oriented so that the orientation contains no directed cycle and no cycle becomes directed after reversing the orientation of a single edge?
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.