Harutyunyan, Ararat


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

Author(s): Harutyunyan

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

Keywords:

Syndicate content