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?
I'm aware that Imgur.com will stop allowing adult images since 15th of May. I'm taking actions to backup as much data as possible.
Read more on this topic here - https://archived.moe/talk/thread/1694/ If you need a post removed click on it's [Report] button and follow the instruction.
DMCA Content Takedown via dmca.com All images are hosted on imgur.com.
If you like this website please support us by donating with Bitcoins at 16mKtbZiwW52BLkibtCr8jUg2KVUMTxVQ5 All trademarks and copyrights on this page are owned by their respective parties.
Images uploaded are the responsibility of the Poster. Comments are owned by the Poster.
This is a 4chan archive - all of the content originated from that site.
This means that RandomArchive shows their content, archived.
If you need information for a Poster - contact them.