When does the complete bipartite graph K n,m have an Euler Trail(Path)?











up vote
1
down vote

favorite












So I know that an Euler trail must have no more than two odd degree vertices.



So does this mean that either $n$ or $m$ must be odd? Or is it $n = m + 1$?






proof-verification graph-theory bipartite-graph eulerian-path







share|cite|improve this question




























    up vote
    1
    down vote

    favorite












    So I know that an Euler trail must have no more than two odd degree vertices.



    So does this mean that either $n$ or $m$ must be odd? Or is it $n = m + 1$?






    proof-verification graph-theory bipartite-graph eulerian-path







    share|cite|improve this question


























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      So I know that an Euler trail must have no more than two odd degree vertices.



      So does this mean that either $n$ or $m$ must be odd? Or is it $n = m + 1$?






      proof-verification graph-theory bipartite-graph eulerian-path







      share|cite|improve this question















      So I know that an Euler trail must have no more than two odd degree vertices.



      So does this mean that either $n$ or $m$ must be odd? Or is it $n = m + 1$?






      proof-verification graph-theory bipartite-graph eulerian-path




      proof-verification graph-theory bipartite-graph eulerian-path






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 14 hours ago









      Especially Lime

      20.9k22655




      20.9k22655










      asked 15 hours ago









      johntc121

      194




      194






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          2
          down vote



          accepted










          You're right that it has an Euler trail if and only if the number of odd-degree vertices is at most $2$.



          In $K_{m,n}$ there are $m$ vertices of degree $n$ and $n$ vertices of degree $n$.



          If $m,n$ are both even then all degrees are even so there is an Euler trail.



          If exactly one of them, say $m$, is odd then there are $n$ vertices of odd degree. So when can there be an Euler trail in this case?



          If $m,n$ are both odd then there are $m+n$ odd degree vertices. When does this give an Euler trail?






          share|cite|improve this answer





















          • So does this mean that there are two possiblities for the odd occurence? Ie... n = m =1? and n =2 and m = odd number >= 1?
            – johntc121
            14 hours ago












          • @johntc121 yes, that's exactly right (of course you can also swap $m$ and $n$ in the second case).
            – Especially Lime
            14 hours ago












          • Awesome. Thank you so much
            – johntc121
            8 hours ago











          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',
          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%2f3004736%2fwhen-does-the-complete-bipartite-graph-k-n-m-have-an-euler-trailpath%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








          up vote
          2
          down vote



          accepted










          You're right that it has an Euler trail if and only if the number of odd-degree vertices is at most $2$.



          In $K_{m,n}$ there are $m$ vertices of degree $n$ and $n$ vertices of degree $n$.



          If $m,n$ are both even then all degrees are even so there is an Euler trail.



          If exactly one of them, say $m$, is odd then there are $n$ vertices of odd degree. So when can there be an Euler trail in this case?



          If $m,n$ are both odd then there are $m+n$ odd degree vertices. When does this give an Euler trail?






          share|cite|improve this answer





















          • So does this mean that there are two possiblities for the odd occurence? Ie... n = m =1? and n =2 and m = odd number >= 1?
            – johntc121
            14 hours ago












          • @johntc121 yes, that's exactly right (of course you can also swap $m$ and $n$ in the second case).
            – Especially Lime
            14 hours ago












          • Awesome. Thank you so much
            – johntc121
            8 hours ago















          up vote
          2
          down vote



          accepted










          You're right that it has an Euler trail if and only if the number of odd-degree vertices is at most $2$.



          In $K_{m,n}$ there are $m$ vertices of degree $n$ and $n$ vertices of degree $n$.



          If $m,n$ are both even then all degrees are even so there is an Euler trail.



          If exactly one of them, say $m$, is odd then there are $n$ vertices of odd degree. So when can there be an Euler trail in this case?



          If $m,n$ are both odd then there are $m+n$ odd degree vertices. When does this give an Euler trail?






          share|cite|improve this answer





















          • So does this mean that there are two possiblities for the odd occurence? Ie... n = m =1? and n =2 and m = odd number >= 1?
            – johntc121
            14 hours ago












          • @johntc121 yes, that's exactly right (of course you can also swap $m$ and $n$ in the second case).
            – Especially Lime
            14 hours ago












          • Awesome. Thank you so much
            – johntc121
            8 hours ago













          up vote
          2
          down vote



          accepted







          up vote
          2
          down vote



          accepted






          You're right that it has an Euler trail if and only if the number of odd-degree vertices is at most $2$.



          In $K_{m,n}$ there are $m$ vertices of degree $n$ and $n$ vertices of degree $n$.



          If $m,n$ are both even then all degrees are even so there is an Euler trail.



          If exactly one of them, say $m$, is odd then there are $n$ vertices of odd degree. So when can there be an Euler trail in this case?



          If $m,n$ are both odd then there are $m+n$ odd degree vertices. When does this give an Euler trail?






          share|cite|improve this answer












          You're right that it has an Euler trail if and only if the number of odd-degree vertices is at most $2$.



          In $K_{m,n}$ there are $m$ vertices of degree $n$ and $n$ vertices of degree $n$.



          If $m,n$ are both even then all degrees are even so there is an Euler trail.



          If exactly one of them, say $m$, is odd then there are $n$ vertices of odd degree. So when can there be an Euler trail in this case?



          If $m,n$ are both odd then there are $m+n$ odd degree vertices. When does this give an Euler trail?







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 14 hours ago









          Especially Lime

          20.9k22655




          20.9k22655












          • So does this mean that there are two possiblities for the odd occurence? Ie... n = m =1? and n =2 and m = odd number >= 1?
            – johntc121
            14 hours ago












          • @johntc121 yes, that's exactly right (of course you can also swap $m$ and $n$ in the second case).
            – Especially Lime
            14 hours ago












          • Awesome. Thank you so much
            – johntc121
            8 hours ago


















          • So does this mean that there are two possiblities for the odd occurence? Ie... n = m =1? and n =2 and m = odd number >= 1?
            – johntc121
            14 hours ago












          • @johntc121 yes, that's exactly right (of course you can also swap $m$ and $n$ in the second case).
            – Especially Lime
            14 hours ago












          • Awesome. Thank you so much
            – johntc121
            8 hours ago
















          So does this mean that there are two possiblities for the odd occurence? Ie... n = m =1? and n =2 and m = odd number >= 1?
          – johntc121
          14 hours ago






          So does this mean that there are two possiblities for the odd occurence? Ie... n = m =1? and n =2 and m = odd number >= 1?
          – johntc121
          14 hours ago














          @johntc121 yes, that's exactly right (of course you can also swap $m$ and $n$ in the second case).
          – Especially Lime
          14 hours ago






          @johntc121 yes, that's exactly right (of course you can also swap $m$ and $n$ in the second case).
          – Especially Lime
          14 hours ago














          Awesome. Thank you so much
          – johntc121
          8 hours ago




          Awesome. Thank you so much
          – johntc121
          8 hours ago


















           

          draft saved


          draft discarded



















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004736%2fwhen-does-the-complete-bipartite-graph-k-n-m-have-an-euler-trailpath%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

          'app-layout' is not a known element: how to share Component with different Modules

          Image
          0 My application was working fine until I decided to go with lazy loading: So, my shared component looks like this: import { Component, Renderer2 } from '@angular/core'; export interface FormModel { captcha?: string; } @Component({ selector: 'app-layout', templateUrl: './app-layout.component.html', styleUrls: ['./app-layout.css'] }) export class FullLayoutComponent { } app-layout.component.ts I am using this component in my Another component say school-home.component.html like this: <app-layout> </app-layout> and it was working fine until I created a Module school-home.module.ts like this: import { NgModule } from '@angular/core'; import { CommonModule } from '@angular/common'; import { SchoolhomeRoutingModule ...
          Read more

          android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

          Image
          .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 0 This is a simple project showing cubes on Unity, exported to android project and imported on Android studio. On maifest file it showed following warning: Expecting <uses-feature android:name="android.software.leanback" android:required="false" /> tag I have no information about it. And also on default emptyview android project does not use/mention this feature. I know it is required by TV's and such but why its not added by default? Why is this? And Should I concern about it? android unity3d ...
          Read more

          WPF add header to Image with URL pettitions [duplicate]

          Image
          up vote 0 down vote favorite This question already has an answer here: Image source URI requiring authorization 3 answers Add header to all* HTTP requests on a machine 1 answer first of all sorry for my english. Recently I added some security in the backend of my project, and now I need to send a validation code(apiKey) inside the headers to retrieve the images. I have a problem with ALL images in my project that I had attached in my UI. For example, before I had: <Image Height="90" Source="{Binding Video.Thumbnail}"/> Now I need to change my code to create a CUSTOM petition add the apiKey in the header:...
          Read more