Is there any work on partition a partial order set into minimum number total order subsets?












3












$begingroup$


The problem is what's the minimum number of total order subsets can a partial order set partition into?



For example, (1,2) and (3,4) are comparable i.e. (1,2) < (3,4), and (1,2) and (2,1) are incomparable. For the partial order set { (1,2), (3,4), (2,1)} we can partition into two subsets {(1,2), (3,4)} and {(2,1)}, which both are total order sets.



I searched on the web and found little related documents. The question is that whether any works or solutions on this problem exist?






discrete-mathematics order-theory set-partition







share|cite|improve this question











$endgroup$








  • 4




    $begingroup$
    Consider Dilworth's theorem.
    $endgroup$
    – William Elliot
    Jan 4 at 9:10








  • 1




    $begingroup$
    @WilliamElliot Why not make that an answer?
    $endgroup$
    – Arthur
    Jan 4 at 9:33










  • $begingroup$
    @Arthur. Too short.
    $endgroup$
    – William Elliot
    Jan 4 at 11:31










  • $begingroup$
    @WilliamElliot Not at all.
    $endgroup$
    – Arthur
    Jan 4 at 11:36
















3












$begingroup$


The problem is what's the minimum number of total order subsets can a partial order set partition into?



For example, (1,2) and (3,4) are comparable i.e. (1,2) < (3,4), and (1,2) and (2,1) are incomparable. For the partial order set { (1,2), (3,4), (2,1)} we can partition into two subsets {(1,2), (3,4)} and {(2,1)}, which both are total order sets.



I searched on the web and found little related documents. The question is that whether any works or solutions on this problem exist?






discrete-mathematics order-theory set-partition







share|cite|improve this question











$endgroup$








  • 4




    $begingroup$
    Consider Dilworth's theorem.
    $endgroup$
    – William Elliot
    Jan 4 at 9:10








  • 1




    $begingroup$
    @WilliamElliot Why not make that an answer?
    $endgroup$
    – Arthur
    Jan 4 at 9:33










  • $begingroup$
    @Arthur. Too short.
    $endgroup$
    – William Elliot
    Jan 4 at 11:31










  • $begingroup$
    @WilliamElliot Not at all.
    $endgroup$
    – Arthur
    Jan 4 at 11:36














3












3








3


0



$begingroup$


The problem is what's the minimum number of total order subsets can a partial order set partition into?



For example, (1,2) and (3,4) are comparable i.e. (1,2) < (3,4), and (1,2) and (2,1) are incomparable. For the partial order set { (1,2), (3,4), (2,1)} we can partition into two subsets {(1,2), (3,4)} and {(2,1)}, which both are total order sets.



I searched on the web and found little related documents. The question is that whether any works or solutions on this problem exist?






discrete-mathematics order-theory set-partition







share|cite|improve this question











$endgroup$




The problem is what's the minimum number of total order subsets can a partial order set partition into?



For example, (1,2) and (3,4) are comparable i.e. (1,2) < (3,4), and (1,2) and (2,1) are incomparable. For the partial order set { (1,2), (3,4), (2,1)} we can partition into two subsets {(1,2), (3,4)} and {(2,1)}, which both are total order sets.



I searched on the web and found little related documents. The question is that whether any works or solutions on this problem exist?






discrete-mathematics order-theory set-partition




discrete-mathematics order-theory set-partition






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 4 at 8:58









Asaf Karagila♦

307k33441774




307k33441774










asked Jan 4 at 8:23









wang zhihaowang zhihao

1166




1166








  • 4




    $begingroup$
    Consider Dilworth's theorem.
    $endgroup$
    – William Elliot
    Jan 4 at 9:10








  • 1




    $begingroup$
    @WilliamElliot Why not make that an answer?
    $endgroup$
    – Arthur
    Jan 4 at 9:33










  • $begingroup$
    @Arthur. Too short.
    $endgroup$
    – William Elliot
    Jan 4 at 11:31










  • $begingroup$
    @WilliamElliot Not at all.
    $endgroup$
    – Arthur
    Jan 4 at 11:36














  • 4




    $begingroup$
    Consider Dilworth's theorem.
    $endgroup$
    – William Elliot
    Jan 4 at 9:10








  • 1




    $begingroup$
    @WilliamElliot Why not make that an answer?
    $endgroup$
    – Arthur
    Jan 4 at 9:33










  • $begingroup$
    @Arthur. Too short.
    $endgroup$
    – William Elliot
    Jan 4 at 11:31










  • $begingroup$
    @WilliamElliot Not at all.
    $endgroup$
    – Arthur
    Jan 4 at 11:36








4




4




$begingroup$
Consider Dilworth's theorem.
$endgroup$
– William Elliot
Jan 4 at 9:10






$begingroup$
Consider Dilworth's theorem.
$endgroup$
– William Elliot
Jan 4 at 9:10






1




1




$begingroup$
@WilliamElliot Why not make that an answer?
$endgroup$
– Arthur
Jan 4 at 9:33




$begingroup$
@WilliamElliot Why not make that an answer?
$endgroup$
– Arthur
Jan 4 at 9:33












$begingroup$
@Arthur. Too short.
$endgroup$
– William Elliot
Jan 4 at 11:31




$begingroup$
@Arthur. Too short.
$endgroup$
– William Elliot
Jan 4 at 11:31












$begingroup$
@WilliamElliot Not at all.
$endgroup$
– Arthur
Jan 4 at 11:36




$begingroup$
@WilliamElliot Not at all.
$endgroup$
– Arthur
Jan 4 at 11:36










1 Answer
1






active

oldest

votes


















1












$begingroup$

Given a finite partially ordered set, Dilworth's theorem says that the minimal number of totally ordered subsets needed to cover the entire set is equal to the size of the largest antichain (also known as the width of the set). An antichain is a subset where no element is comparable to any of the other elements in the antichain.






share|cite|improve this answer











$endgroup$














    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "69"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3061422%2fis-there-any-work-on-partition-a-partial-order-set-into-minimum-number-total-ord%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1












    $begingroup$

    Given a finite partially ordered set, Dilworth's theorem says that the minimal number of totally ordered subsets needed to cover the entire set is equal to the size of the largest antichain (also known as the width of the set). An antichain is a subset where no element is comparable to any of the other elements in the antichain.






    share|cite|improve this answer











    $endgroup$


















      1












      $begingroup$

      Given a finite partially ordered set, Dilworth's theorem says that the minimal number of totally ordered subsets needed to cover the entire set is equal to the size of the largest antichain (also known as the width of the set). An antichain is a subset where no element is comparable to any of the other elements in the antichain.






      share|cite|improve this answer











      $endgroup$
















        1












        1








        1





        $begingroup$

        Given a finite partially ordered set, Dilworth's theorem says that the minimal number of totally ordered subsets needed to cover the entire set is equal to the size of the largest antichain (also known as the width of the set). An antichain is a subset where no element is comparable to any of the other elements in the antichain.






        share|cite|improve this answer











        $endgroup$



        Given a finite partially ordered set, Dilworth's theorem says that the minimal number of totally ordered subsets needed to cover the entire set is equal to the size of the largest antichain (also known as the width of the set). An antichain is a subset where no element is comparable to any of the other elements in the antichain.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Jan 4 at 12:32

























        answered Jan 4 at 11:36









        ArthurArthur

        122k7122210




        122k7122210






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid …



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3061422%2fis-there-any-work-on-partition-a-partial-order-set-into-minimum-number-total-ord%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            -

            Popular posts from this blog

            Wiesbaden

            Image
            Wappen Deutschlandkarte 50.0825 8.24 117 Koordinaten: 50° 5′  N , 8° 14′  O Basisdaten Bundesland: Hessen Regierungsbezirk: Darmstadt Höhe: 117 m ü. NHN Fläche: 203,93 km 2 Einwohner: 278.654 (31. Dez. 2017) [1] Bevölkerungsdichte: 1366 Einwohner je km 2 Postleitzahlen: 65183–65207, 55246, 55252 Vorlage:Infobox Gemeinde in Deutschland/Wartung/PLZ enthält Text Vorwahlen: 0611, 06122, 06127, 06134 Kfz-Kennzeichen: WI Gemeindeschlüssel: 06 4 14 000 LOCODE: DE WIB NUTS: DE714 Stadtgliederung: 26 Ortsbezirke Adresse der Stadtverwaltung: Schlossplatz 6 65183 Wiesbaden Webpräsenz: www.wiesbaden.de Oberbürgermeister: Sven Gerich (SPD) Lage der Landeshauptstadt Wiesbaden in Hessen und im Regierungsbezirk Darmstadt Offizielles Logo der Landeshauptstadt Wiesbaden Flagge der Landeshauptstadt Wiesbaden Wiesbaden is
            Read more

            Marschland

            Image
            Kilometerweite Marsch in den Vier- und Marschlanden am Elbdeich Die Wedeler Marschlandschaft in Schleswig-Holstein Der Hadelner Kanal zur Entwässerung der Marsch Die tief gelegene Marsch und ein Entwässerungskanal Das Schöpfwerk Otterndorf im Land Hadeln zur Entwässerung der Medem verfügte damals bereits über die größte Kreiselpumpe Europas. Das Schöpfwerk in Neuhaus für die Aue und des Neuhaus-Bülkauer Kanals Als Marsch(land) (v. niederdt., altsächs. mersc ) – auch Masch , Mersch oder Schwemmland genannt – bezeichnet man eine nacheiszeitlich entstandene geomorphologische Landform im Gebiet der nordwestdeutschen Küsten und Flüsse sowie vergleichbare Landformen weltweit. Inhaltsverzeichnis 1 Landschaft 2 Entstehung 3 Marschböden 4 Nutzung 5 Marschgebiete in Deutschland 6 Siehe auch 7 Literatur 8 Weblinks 9 Einzelnachweise Landschaft | Marschen sind generell flache Landstriche ohne natürliche Erhebungen. Si
            Read more

            Dieringhausen

            Image
            Dieringhausen Stadt Gummersbach 50.982777777778 7.5316666666667 165 Koordinaten: 50° 58′ 58″  N , 7° 31′ 54″  O Höhe: 165  (160–245)  m Einwohner: 5055  (30. Jun. 2016) Postleitzahl: 51645 Vorwahl: 02261 Lage von Dieringhausen in Gummersbach Im Hohl ca. 1927–1930 Ansicht von Südwesten bei Bünghausen Dieringhausen (im örtlichen Dialekt Dierkesen ) ist ein Ortsteil von Gummersbach im Oberbergischen Kreis, Regierungsbezirk Köln, Nordrhein-Westfalen (Deutschland). Inhaltsverzeichnis 1 Geographie 2 Geschichte 3 Kultur 3.1 Sehenswürdigkeiten 3.2 Regelmäßige Veranstaltungen 4 Infrastruktur und Wirtschaft 4.1 Verkehr 4.1.1 Schienen- und Busverkehr 4.1.2 Straßen 4.2 Öffentliche Einrichtungen 4.2.1 Schulen und Bildungseinrichtungen 4.2.2 Kirchliche Einrichtungen 5 Persönlichkeiten 5.1 In Dieringhausen geboren 5.2 In Dieringhausen gelebt 6 Einzelnachweise 7
            Read more