2 papers
math.CO2026
Path decompositions of oriented graphs
Viresh Patel, Mehmet Akif Yıldız
We consider the problem of decomposing the edges of a digraph into as few paths as possible. A natural lower bound for the number of paths in any path decomposition of a digraph $D…
math.CO2025
Cycle Partitions in Dense Regular Digraphs and Oriented Graphs
Allan Lo, Viresh Patel, Mehmet Akif Yıldız
A conjecture of Jackson from 1981 states that every -regular oriented graph on vertices with is Hamiltonian. We prove this conjecture for sufficiently large …