The structure of strong arc-locally semicomplete digraphs (Q1827761): Difference between revisions

In 1993, the author introduced the following class of digraphs. A digraph \(D\) is arc-locally semicomplete if for every pair \(x,y\) of adjacent vertices their in-neighbors (out-neighbors) \(u,v\) either coincide or are adjacent. The main theorem is as follows. A strong arc-locally semicomplete digraph is either semicomplete, or semicomplete bipartite, or is obtained from a cycle \(C_m\) by substituting an independent set for each vertex in \(C_m.\)