Open Problem Garden
Help
About
Contact
login/create account
Graph Theory
»
Directed Graphs
Large acyclic induced subdigraph in a planar oriented graph.
★★
Author(s):
Harutyunyan
Conjecture
Every planar oriented graph
has an acyclic induced subdigraph of order at least
.
Keywords:
Posted by
fhavet
updated June 25th, 2013
add new comment
jane
jerseys
prime gap
de Polignac, Alphonse
circuit complexity
BPP
pseudorandom generators
KanikaVashisht
logical independence
« first
‹ previous
…
20
21
22
23
24
25
26
27
28
…
next ›
last »
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
Chords of longest cycles
Do any three longest paths in a connected graph have a vertex in common?
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
more