Directed forcing conjecture for oriented graphs
Let be an oriented graph, let be its underlying undirected graph obtained by forgetting edge directions, and call directed-forcing when it has the directed forcing property. Directed forcing conjecture. If has a homomorphism to an edge and contains a cycle, then has the directed forcing property. The paper proves that a homomorphism to an edge and a cycle in the underlying graph are necessary conditions for directed forcing. It conjectures that these two conditions are also sufficient, leaving the characterization open.
References
- Jacob Fox, Zoe Himwich, Nitya Mani and Yunkun Zhou, “A note on directed analogues of the Sidorenko and forcing conjectures”, arXiv:2210.16971 (2022).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.