Proof of a Lemma for Saturated Non-Factorizable Graphs












0












$begingroup$


I have the following queries about the lemma on saturated non-factorizable graphs. My attempt at constructing a saturated non-factorizable graph also seems to contradict the lemma.



(The proof is taken from the book A walk Through Combinatorics by Miklos Bona.)



enter image description here










share|cite|improve this question











$endgroup$

















    0












    $begingroup$


    I have the following queries about the lemma on saturated non-factorizable graphs. My attempt at constructing a saturated non-factorizable graph also seems to contradict the lemma.



    (The proof is taken from the book A walk Through Combinatorics by Miklos Bona.)



    enter image description here










    share|cite|improve this question











    $endgroup$















      0












      0








      0





      $begingroup$


      I have the following queries about the lemma on saturated non-factorizable graphs. My attempt at constructing a saturated non-factorizable graph also seems to contradict the lemma.



      (The proof is taken from the book A walk Through Combinatorics by Miklos Bona.)



      enter image description here










      share|cite|improve this question











      $endgroup$




      I have the following queries about the lemma on saturated non-factorizable graphs. My attempt at constructing a saturated non-factorizable graph also seems to contradict the lemma.



      (The proof is taken from the book A walk Through Combinatorics by Miklos Bona.)



      enter image description here







      graph-theory proof-explanation matching-theory






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 29 '18 at 12:12







      NetUser5y62

















      asked Dec 29 '18 at 6:04









      NetUser5y62NetUser5y62

      525215




      525215






















          0






          active

          oldest

          votes











          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%2f3055585%2fproof-of-a-lemma-for-saturated-non-factorizable-graphs%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















          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%2f3055585%2fproof-of-a-lemma-for-saturated-non-factorizable-graphs%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

          Probability when a professor distributes a quiz and homework assignment to a class of n students.

          Aardman Animations

          Are they similar matrix