The Path Partition Conjecture and 3-(quasi-)Transitive Digraphs

Shamik Ghosh, Jing Huang

A digraph $D=(V,E)$ is 3-transitive (respectively, 3-quasi-transitive) if whenever $(u,v,w,z)$ is a directed path of length 3, $(u,z)\in E$ (respectively, $(u,z)\in E$ or $(z,u…