Acyclic orientations of complete bipartite graphs Original Research Article

For a complete bipartite graph, the number of dependent edges in an acyclic orientation can be any integer from n−1 to e, where n and e are the number of vertices and edges in the graph.