[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math


View post   

File: 21 KB, 788x200, order-final.jpg [View same] [iqdb] [saucenao] [google]
8980254 No.8980254 [Reply] [Original]

Dilworth's Theorem states that in any finite partially ordered set, the size of the maximal antichain is the size of the minimal partition of the nodes in linear orders, see pic related.

Is there a similar result for the partition of the edges?