Li's directed conjecture for oriented bipartite graphs
Li's directed conjecture for oriented bipartite graphs
Let be an oriented bipartite graph with bipartition , and let denote the out-degree of a vertex . A directed is a directed cycle of length four in . Li's conjecture. If
for each and
for each , then has a directed . H. Li proposed this conjecture and proved it for balanced oriented bipartite graphs; the general statement is not resolved by the supplied text.
Sources & referencesView supporting material
Primary source
Bo Ning and Jun Ge, “Rainbow C_4's and Directed C_4's: the Bipartite Case Study”, arXiv:1301.5697 (2013).
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
Sign in to submit a solution.
No solutions have been posted yet.