| dc.contributor.author | Golowich, Noah | |
| dc.contributor.author | Rolnick, David S. | |
| dc.date.accessioned | 2015-09-08T18:58:24Z | |
| dc.date.available | 2015-09-08T18:58:24Z | |
| dc.date.issued | 2015-07 | |
| dc.date.submitted | 2014-08 | |
| dc.identifier.issn | 1077-8926 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/98410 | |
| dc.description.abstract | 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. | en_US |
| dc.language.iso | en_US | |
| dc.publisher | European Mathematical Information Service (EMIS) | en_US |
| dc.relation.isversionof | http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i3p7/pdf | en_US |
| dc.rights | Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. | en_US |
| dc.source | European Mathematical Information Service (EMIS) | en_US |
| dc.title | Acyclic Subgraphs of Planar Digraphs | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Golowich, Noah, and David Rolnick. "Acyclic Subgraphs of Planar Digraphs." The Electronic Journal of Combinatorics 22(3) (2015), #P3.7. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
| dc.contributor.mitauthor | Rolnick, David S. | en_US |
| dc.relation.journal | Electronic Journal of Combinatorics | en_US |
| dc.eprint.version | Final published version | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dspace.orderedauthors | Golowich, Noah; Rolnick, David | en_US |
| mit.license | PUBLISHER_POLICY | en_US |
| mit.metadata.status | Complete | |
