erdős #1006
Let be a graph with girth (that is, it contains no cycles of length or ). Can the edges of always be directed such that there is no directed cycle, and reversing the direction of any edge also creates no directed cycle?
Worked, still open.
graph theory · solved · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problems