![](/files/happy5.png)
directed path
Linial-Berge path partition duality ★★★
Conjecture The minimum
-norm of a path partition on a directed graph
is no more than the maximal size of an induced
-colorable subgraph.
![$ k $](/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png)
![$ D $](/files/tex/b8653a25aff72e3dacd3642492c24c2241f0058c.png)
![$ k $](/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png)
Keywords: coloring; directed path; partition
![Syndicate content Syndicate content](/misc/feed.png)
Keywords: coloring; directed path; partition