from ABC134E The minimum path coverage on the DAG (the minimum number of paths required to split a vertex so that all vertices belong to the appropriate path) is equal to the number of elements in the maximum antichain (a set of vertices such that for any two vertices in the set, there is no path connecting them)
This page is auto-translated from /nishio/Dilworthの定理 using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.