existence of a certain subset of vertices in a graph












4














Take an undirected graph $G=(V,E)$. For any subset $Msubseteq V$, we define ${rm deg}_M(v)=|{kin M:(v,k)in E}|$, namely, the number of neighbors of $v$ in $M$.



Is it true that, there exists a subset $Msubseteq V$ such that, for every $vin M$, ${rm deg}_M(v)leq 3$, and for every $v'in Vsetminus M$, ${rm deg}_M(v')geq 4$?



Note that, some obvious cases. If nobody are friends, we can simply take $V$ to be the entire set. Similarly, if $G$ is fully connected, then any $4-$element subset work. I tried to reason in the following way, take a maximal (in the sense of cardinality) $M$, such that, for every $vin M$, ${rm deg}_M(v)leq 3$. Now, for any point outside, if it has $geq 4$ neighbors, we are done. If not, then there are points in $M$, which are neighbors of $v$, such that, their in$-M$ degree is precisely $3$, but this did not lead me to anywhere.






co.combinatorics graph-theory







share|cite|improve this question



























    4














    Take an undirected graph $G=(V,E)$. For any subset $Msubseteq V$, we define ${rm deg}_M(v)=|{kin M:(v,k)in E}|$, namely, the number of neighbors of $v$ in $M$.



    Is it true that, there exists a subset $Msubseteq V$ such that, for every $vin M$, ${rm deg}_M(v)leq 3$, and for every $v'in Vsetminus M$, ${rm deg}_M(v')geq 4$?



    Note that, some obvious cases. If nobody are friends, we can simply take $V$ to be the entire set. Similarly, if $G$ is fully connected, then any $4-$element subset work. I tried to reason in the following way, take a maximal (in the sense of cardinality) $M$, such that, for every $vin M$, ${rm deg}_M(v)leq 3$. Now, for any point outside, if it has $geq 4$ neighbors, we are done. If not, then there are points in $M$, which are neighbors of $v$, such that, their in$-M$ degree is precisely $3$, but this did not lead me to anywhere.






    co.combinatorics graph-theory







    share|cite|improve this question

























      4












      4








      4


      1





      Take an undirected graph $G=(V,E)$. For any subset $Msubseteq V$, we define ${rm deg}_M(v)=|{kin M:(v,k)in E}|$, namely, the number of neighbors of $v$ in $M$.



      Is it true that, there exists a subset $Msubseteq V$ such that, for every $vin M$, ${rm deg}_M(v)leq 3$, and for every $v'in Vsetminus M$, ${rm deg}_M(v')geq 4$?



      Note that, some obvious cases. If nobody are friends, we can simply take $V$ to be the entire set. Similarly, if $G$ is fully connected, then any $4-$element subset work. I tried to reason in the following way, take a maximal (in the sense of cardinality) $M$, such that, for every $vin M$, ${rm deg}_M(v)leq 3$. Now, for any point outside, if it has $geq 4$ neighbors, we are done. If not, then there are points in $M$, which are neighbors of $v$, such that, their in$-M$ degree is precisely $3$, but this did not lead me to anywhere.






      co.combinatorics graph-theory







      share|cite|improve this question













      Take an undirected graph $G=(V,E)$. For any subset $Msubseteq V$, we define ${rm deg}_M(v)=|{kin M:(v,k)in E}|$, namely, the number of neighbors of $v$ in $M$.



      Is it true that, there exists a subset $Msubseteq V$ such that, for every $vin M$, ${rm deg}_M(v)leq 3$, and for every $v'in Vsetminus M$, ${rm deg}_M(v')geq 4$?



      Note that, some obvious cases. If nobody are friends, we can simply take $V$ to be the entire set. Similarly, if $G$ is fully connected, then any $4-$element subset work. I tried to reason in the following way, take a maximal (in the sense of cardinality) $M$, such that, for every $vin M$, ${rm deg}_M(v)leq 3$. Now, for any point outside, if it has $geq 4$ neighbors, we are done. If not, then there are points in $M$, which are neighbors of $v$, such that, their in$-M$ degree is precisely $3$, but this did not lead me to anywhere.






      co.combinatorics graph-theory




      co.combinatorics graph-theory






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 22 at 23:50









      kawa

      1587




      1587






















          1 Answer
          1






          active

          oldest

          votes


















          9














          Let us consider all sets $M$ with $d_M(v)le 3$ for all $vin M$ (I'll write $d$ instead of $rm{deg}$) and choose the set that maximizes
          $$
          |M|-frac 14 E(M)
          $$
          where $E(M)$ is the number of edges between the vertices in $M$.
          Assume that there is a vertex $w$ with $d_M(w)le 3$. We can try to add it to $M$ but it may spoil some its neighbors in $M$ (those that had degree $3$ in $M$ already). Then we may just delete the bad neighbors one by one as long as their degree is $4$ (after the first deletion we can improve other vertices too, so we may delete only part of spoiled neighbors and the rest may get their low degree recovered). If we do $k$ deletions, we get $|M|to |M|+1-k$, $E(M)to le E(M)+3-4k$, which certainly increases the functional by at least $frac 14$. Thus the trivial algorithm (add a vertex and remove the resulting conflicts, if any, one by one) works and achieves the desired result in $4|V|$ steps at the worst.






          share|cite|improve this answer





















          • And of course the same argument shows that, for any nonnegative integer $d$ and any finite graph $G=(V,E)$, there is a set $Msubseteq V$ such that $M={xin V:|N(x)cap M|le d}$. Is this also true for infinite graphs?
            – bof
            Nov 23 at 5:49










          • @bof Hard to tell... Of course, when we have some sort of compactness principle, we can reduce the question to the finite case, but what would you do in the case of the unit distance graph for the points in $mathbb R^n$, for instance?
            – fedja
            Nov 23 at 22:19










          • At least it's true for locally finite graphs, by compactness. Right?
            – bof
            Nov 24 at 12:46












          • The unit distance graph on $mathbb R^n$ is easy. The cases $n=0$ (finite graph) and $n=1$ (locally finite) are trivial. For $nge2$ an easy transfinite construction (with the axiom of choice of course) gets us a set $Asubsetmathbb R^n$ such that $|N(x)cap A|=0$ for $xin A$ while $|N(x)cap A|=|mathbb R|$ for $xinmathbb R^nsetminus A$.
            – bof
            Nov 27 at 6:57











          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: "504"
          };
          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%2fmathoverflow.net%2fquestions%2f315994%2fexistence-of-a-certain-subset-of-vertices-in-a-graph%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









          9














          Let us consider all sets $M$ with $d_M(v)le 3$ for all $vin M$ (I'll write $d$ instead of $rm{deg}$) and choose the set that maximizes
          $$
          |M|-frac 14 E(M)
          $$
          where $E(M)$ is the number of edges between the vertices in $M$.
          Assume that there is a vertex $w$ with $d_M(w)le 3$. We can try to add it to $M$ but it may spoil some its neighbors in $M$ (those that had degree $3$ in $M$ already). Then we may just delete the bad neighbors one by one as long as their degree is $4$ (after the first deletion we can improve other vertices too, so we may delete only part of spoiled neighbors and the rest may get their low degree recovered). If we do $k$ deletions, we get $|M|to |M|+1-k$, $E(M)to le E(M)+3-4k$, which certainly increases the functional by at least $frac 14$. Thus the trivial algorithm (add a vertex and remove the resulting conflicts, if any, one by one) works and achieves the desired result in $4|V|$ steps at the worst.






          share|cite|improve this answer





















          • And of course the same argument shows that, for any nonnegative integer $d$ and any finite graph $G=(V,E)$, there is a set $Msubseteq V$ such that $M={xin V:|N(x)cap M|le d}$. Is this also true for infinite graphs?
            – bof
            Nov 23 at 5:49










          • @bof Hard to tell... Of course, when we have some sort of compactness principle, we can reduce the question to the finite case, but what would you do in the case of the unit distance graph for the points in $mathbb R^n$, for instance?
            – fedja
            Nov 23 at 22:19










          • At least it's true for locally finite graphs, by compactness. Right?
            – bof
            Nov 24 at 12:46












          • The unit distance graph on $mathbb R^n$ is easy. The cases $n=0$ (finite graph) and $n=1$ (locally finite) are trivial. For $nge2$ an easy transfinite construction (with the axiom of choice of course) gets us a set $Asubsetmathbb R^n$ such that $|N(x)cap A|=0$ for $xin A$ while $|N(x)cap A|=|mathbb R|$ for $xinmathbb R^nsetminus A$.
            – bof
            Nov 27 at 6:57
















          9














          Let us consider all sets $M$ with $d_M(v)le 3$ for all $vin M$ (I'll write $d$ instead of $rm{deg}$) and choose the set that maximizes
          $$
          |M|-frac 14 E(M)
          $$
          where $E(M)$ is the number of edges between the vertices in $M$.
          Assume that there is a vertex $w$ with $d_M(w)le 3$. We can try to add it to $M$ but it may spoil some its neighbors in $M$ (those that had degree $3$ in $M$ already). Then we may just delete the bad neighbors one by one as long as their degree is $4$ (after the first deletion we can improve other vertices too, so we may delete only part of spoiled neighbors and the rest may get their low degree recovered). If we do $k$ deletions, we get $|M|to |M|+1-k$, $E(M)to le E(M)+3-4k$, which certainly increases the functional by at least $frac 14$. Thus the trivial algorithm (add a vertex and remove the resulting conflicts, if any, one by one) works and achieves the desired result in $4|V|$ steps at the worst.






          share|cite|improve this answer





















          • And of course the same argument shows that, for any nonnegative integer $d$ and any finite graph $G=(V,E)$, there is a set $Msubseteq V$ such that $M={xin V:|N(x)cap M|le d}$. Is this also true for infinite graphs?
            – bof
            Nov 23 at 5:49










          • @bof Hard to tell... Of course, when we have some sort of compactness principle, we can reduce the question to the finite case, but what would you do in the case of the unit distance graph for the points in $mathbb R^n$, for instance?
            – fedja
            Nov 23 at 22:19










          • At least it's true for locally finite graphs, by compactness. Right?
            – bof
            Nov 24 at 12:46












          • The unit distance graph on $mathbb R^n$ is easy. The cases $n=0$ (finite graph) and $n=1$ (locally finite) are trivial. For $nge2$ an easy transfinite construction (with the axiom of choice of course) gets us a set $Asubsetmathbb R^n$ such that $|N(x)cap A|=0$ for $xin A$ while $|N(x)cap A|=|mathbb R|$ for $xinmathbb R^nsetminus A$.
            – bof
            Nov 27 at 6:57














          9












          9








          9






          Let us consider all sets $M$ with $d_M(v)le 3$ for all $vin M$ (I'll write $d$ instead of $rm{deg}$) and choose the set that maximizes
          $$
          |M|-frac 14 E(M)
          $$
          where $E(M)$ is the number of edges between the vertices in $M$.
          Assume that there is a vertex $w$ with $d_M(w)le 3$. We can try to add it to $M$ but it may spoil some its neighbors in $M$ (those that had degree $3$ in $M$ already). Then we may just delete the bad neighbors one by one as long as their degree is $4$ (after the first deletion we can improve other vertices too, so we may delete only part of spoiled neighbors and the rest may get their low degree recovered). If we do $k$ deletions, we get $|M|to |M|+1-k$, $E(M)to le E(M)+3-4k$, which certainly increases the functional by at least $frac 14$. Thus the trivial algorithm (add a vertex and remove the resulting conflicts, if any, one by one) works and achieves the desired result in $4|V|$ steps at the worst.






          share|cite|improve this answer












          Let us consider all sets $M$ with $d_M(v)le 3$ for all $vin M$ (I'll write $d$ instead of $rm{deg}$) and choose the set that maximizes
          $$
          |M|-frac 14 E(M)
          $$
          where $E(M)$ is the number of edges between the vertices in $M$.
          Assume that there is a vertex $w$ with $d_M(w)le 3$. We can try to add it to $M$ but it may spoil some its neighbors in $M$ (those that had degree $3$ in $M$ already). Then we may just delete the bad neighbors one by one as long as their degree is $4$ (after the first deletion we can improve other vertices too, so we may delete only part of spoiled neighbors and the rest may get their low degree recovered). If we do $k$ deletions, we get $|M|to |M|+1-k$, $E(M)to le E(M)+3-4k$, which certainly increases the functional by at least $frac 14$. Thus the trivial algorithm (add a vertex and remove the resulting conflicts, if any, one by one) works and achieves the desired result in $4|V|$ steps at the worst.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 23 at 3:31









          fedja

          37.4k7109203




          37.4k7109203












          • And of course the same argument shows that, for any nonnegative integer $d$ and any finite graph $G=(V,E)$, there is a set $Msubseteq V$ such that $M={xin V:|N(x)cap M|le d}$. Is this also true for infinite graphs?
            – bof
            Nov 23 at 5:49










          • @bof Hard to tell... Of course, when we have some sort of compactness principle, we can reduce the question to the finite case, but what would you do in the case of the unit distance graph for the points in $mathbb R^n$, for instance?
            – fedja
            Nov 23 at 22:19










          • At least it's true for locally finite graphs, by compactness. Right?
            – bof
            Nov 24 at 12:46












          • The unit distance graph on $mathbb R^n$ is easy. The cases $n=0$ (finite graph) and $n=1$ (locally finite) are trivial. For $nge2$ an easy transfinite construction (with the axiom of choice of course) gets us a set $Asubsetmathbb R^n$ such that $|N(x)cap A|=0$ for $xin A$ while $|N(x)cap A|=|mathbb R|$ for $xinmathbb R^nsetminus A$.
            – bof
            Nov 27 at 6:57


















          • And of course the same argument shows that, for any nonnegative integer $d$ and any finite graph $G=(V,E)$, there is a set $Msubseteq V$ such that $M={xin V:|N(x)cap M|le d}$. Is this also true for infinite graphs?
            – bof
            Nov 23 at 5:49










          • @bof Hard to tell... Of course, when we have some sort of compactness principle, we can reduce the question to the finite case, but what would you do in the case of the unit distance graph for the points in $mathbb R^n$, for instance?
            – fedja
            Nov 23 at 22:19










          • At least it's true for locally finite graphs, by compactness. Right?
            – bof
            Nov 24 at 12:46












          • The unit distance graph on $mathbb R^n$ is easy. The cases $n=0$ (finite graph) and $n=1$ (locally finite) are trivial. For $nge2$ an easy transfinite construction (with the axiom of choice of course) gets us a set $Asubsetmathbb R^n$ such that $|N(x)cap A|=0$ for $xin A$ while $|N(x)cap A|=|mathbb R|$ for $xinmathbb R^nsetminus A$.
            – bof
            Nov 27 at 6:57
















          And of course the same argument shows that, for any nonnegative integer $d$ and any finite graph $G=(V,E)$, there is a set $Msubseteq V$ such that $M={xin V:|N(x)cap M|le d}$. Is this also true for infinite graphs?
          – bof
          Nov 23 at 5:49




          And of course the same argument shows that, for any nonnegative integer $d$ and any finite graph $G=(V,E)$, there is a set $Msubseteq V$ such that $M={xin V:|N(x)cap M|le d}$. Is this also true for infinite graphs?
          – bof
          Nov 23 at 5:49












          @bof Hard to tell... Of course, when we have some sort of compactness principle, we can reduce the question to the finite case, but what would you do in the case of the unit distance graph for the points in $mathbb R^n$, for instance?
          – fedja
          Nov 23 at 22:19




          @bof Hard to tell... Of course, when we have some sort of compactness principle, we can reduce the question to the finite case, but what would you do in the case of the unit distance graph for the points in $mathbb R^n$, for instance?
          – fedja
          Nov 23 at 22:19












          At least it's true for locally finite graphs, by compactness. Right?
          – bof
          Nov 24 at 12:46






          At least it's true for locally finite graphs, by compactness. Right?
          – bof
          Nov 24 at 12:46














          The unit distance graph on $mathbb R^n$ is easy. The cases $n=0$ (finite graph) and $n=1$ (locally finite) are trivial. For $nge2$ an easy transfinite construction (with the axiom of choice of course) gets us a set $Asubsetmathbb R^n$ such that $|N(x)cap A|=0$ for $xin A$ while $|N(x)cap A|=|mathbb R|$ for $xinmathbb R^nsetminus A$.
          – bof
          Nov 27 at 6:57




          The unit distance graph on $mathbb R^n$ is easy. The cases $n=0$ (finite graph) and $n=1$ (locally finite) are trivial. For $nge2$ an easy transfinite construction (with the axiom of choice of course) gets us a set $Asubsetmathbb R^n$ such that $|N(x)cap A|=0$ for $xin A$ while $|N(x)cap A|=|mathbb R|$ for $xinmathbb R^nsetminus A$.
          – bof
          Nov 27 at 6:57


















          draft saved

          draft discarded




















































          Thanks for contributing an answer to MathOverflow!


          • 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.





          Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


          Please pay close attention to the following guidance:


          • 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.


          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%2fmathoverflow.net%2fquestions%2f315994%2fexistence-of-a-certain-subset-of-vertices-in-a-graph%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

          A CLEAN and SIMPLE way to add appendices to Table of Contents and bookmarks

          Image
          0 I found a lot of questions abount appendices and ToC. Many users want appendices to be grouped in an Appendix part, however some problems arise with ToC, hyperref, PDF viewer bookmarks, and so on. There are different solutions which require extra packages, command patching and other extra code, however none of them satisfies me. I almost found an easy way to accomplish a good result, where appendices are added to bookmarks in the right way and hyperref links point to the right page. However, the number of the "Appendix" part page is wrong (it's the number of appendix A). Is there any EASY way to fix that? This is a MWE: documentclass{book} usepackage[nottoc,notlot,notlof]{tocbibind} usepackage{hyperref} begin{document} frontmatter tableofcontents mainmatter part{First} chapter{...
          Read more

          Calculate evaluation metrics using cross_val_predict sklearn

          Image
          1 In the sklearn.model_selection.cross_val_predict page it is stated: Generate cross-validated estimates for each input data point. It is not appropriate to pass these predictions into an evaluation metric. Can someone explain what does it mean? If this gives estimate of Y (y prediction) for every Y (true Y), why can't I calculate metrics such as RMSE or coefficient of determination using these results? python scikit-learn cross-validation share | improve this question edited Nov 28 '18 at 17:52 desertnaut 20.3k 7 43 79 ...
          Read more

          Insert data from modal to MySQL (multiple modal on website)

          Image
          0 I have problem with inserting data to MySQL from modal. My modal: <a href="#" class="badge badge-pill badge-success">6 komentarzy</a> <a href="#" class="badge badge-pill badge-danger">brak komentarzy</a> <a data-toggle="modal" href="#add_desk_comm_{$desk_['desk_id']}" data-target="#add_desk_comm_{$desk_['desk_id']}" class="ediiit">(dodaj)</a> <div class="modal fade" id="add_desk_comm_{$desk_['desk_id']}" tabindex="-1" role="dialog" aria-labelledby="edit_printer" aria-hidden="true"> <div class="modal-dialog" role="document"> ...
          Read more