We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyunyan conjectured that every planar digraph on n vertices without directed 2-cycles possesses an acyclic set of size at least 3n=5. We prove this conjecture for digraphs where every directed cycle has length at least 8. More generally, if g is the length of the shortest directed cycle, we show that there exists an acyclic set of size at least (1 - 3/g)n
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.