  We study analogues of Sidorenko's conjecture and the forcing conjecture in
oriented graphs, showing that natural variants of these conjectures in directed
graphs are equivalent to the asymmetric, undirected analogues of the
conjectures.
