Open Problem Garden

Large acyclic induced subdigraph in a planar oriented graph. ★★

Conjecture Every planar oriented graph $D$ has an acyclic induced subdigraph of order at least $\frac{3}{5} |V(D)|$ .

Keywords:

Posted by fhavet
updated June 25th, 2013