Acyclic Subgraphs of Planar Digraphs
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 l...
Main Authors: | Golowich, Noah (Author), Rolnick, David S. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
European Mathematical Information Service (EMIS),
2015-09-08T18:58:24Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
On the size of induced acyclic subgraphs in random digraphs
by: Joel Spencer, et al.
Published: (2008-04-01) -
Approximating the maximum acyclic subgraph
by: Newman, Alantha
Published: (2014) -
Induced Acyclic Tournaments in Random Digraphs: Sharp Concentration, Thresholds and Algorithms
by: Dutta Kunal, et al.
Published: (2014-08-01) -
Maximum flow in planar digraphs
by: Harutyunyan, Anna
Published: (2012) -
Acyclic colourings of planar graphs
by: Raubenheimer, Fredrika Susanna
Published: (2012)