LiniAls Conjecture Backgound In a partially ordered set we have Dilworths Theorem The largest size of an independent set completely unordered set is the smallest number of blocks in a partition of the elements into completely ordered sets ID: 246218
Download Presentation The PPT/PDF document "Some Graph Problems" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
