We have a connected graph with $2n$ nodes. Prove that exsist spanning subgraph each node with odd degree.












2















We have a connected graph with $2n$ nodes. Prove that exsist spanning subgraph each node with odd degree.




Idea: Let $M$ be an adjacency matrix and work all over field $mathbb{Z}_2$. Then if $M$ is nonsingular we know that equation $$Mvec{s} = (1,1,1,....1,1)$$ has notrivial solution. Suppose set $S$ has incidence vector $vec{s}$. Then if for each node $a$ we color each edge in $N(a)cap S$ we win.



There are quite a few questions here. First, where did I use conectivity, second, is it $M$ really nonsingular and do we even need that and last, if all this is true does this aproach actually work?



Note: I already asked initaly question and did get an answer, so please answer just this.






linear-algebra combinatorics graph-theory algebraic-graph-theory algebraic-combinatorics







share|cite|improve this question
























  • Sorry I am a bit confused, do you want an answer to the initial quoted question or are you only asking about your approach?
    – Vincenzo
    2 days ago










  • @Vincenzo second one.
    – greedoid
    2 days ago










  • I don't understand the question - clearly a simple path on $4$ vertices has an even number of vertices, but the only spanning subgraph (being the graph itself) has two vertices of even degree.
    – Math1000
    2 days ago










  • Take a look here. math.stackexchange.com/questions/3047513/… @Math1000
    – greedoid
    2 days ago






  • 1




    If you want a linear algebra solution, you should instead look at the incidence matrix of the graph and try to show that $Me={bf 1}$ has a solution. I do not know if this makes things any easier.
    – Mike Earnest
    21 hours ago
















2















We have a connected graph with $2n$ nodes. Prove that exsist spanning subgraph each node with odd degree.




Idea: Let $M$ be an adjacency matrix and work all over field $mathbb{Z}_2$. Then if $M$ is nonsingular we know that equation $$Mvec{s} = (1,1,1,....1,1)$$ has notrivial solution. Suppose set $S$ has incidence vector $vec{s}$. Then if for each node $a$ we color each edge in $N(a)cap S$ we win.



There are quite a few questions here. First, where did I use conectivity, second, is it $M$ really nonsingular and do we even need that and last, if all this is true does this aproach actually work?



Note: I already asked initaly question and did get an answer, so please answer just this.






linear-algebra combinatorics graph-theory algebraic-graph-theory algebraic-combinatorics







share|cite|improve this question
























  • Sorry I am a bit confused, do you want an answer to the initial quoted question or are you only asking about your approach?
    – Vincenzo
    2 days ago










  • @Vincenzo second one.
    – greedoid
    2 days ago










  • I don't understand the question - clearly a simple path on $4$ vertices has an even number of vertices, but the only spanning subgraph (being the graph itself) has two vertices of even degree.
    – Math1000
    2 days ago










  • Take a look here. math.stackexchange.com/questions/3047513/… @Math1000
    – greedoid
    2 days ago






  • 1




    If you want a linear algebra solution, you should instead look at the incidence matrix of the graph and try to show that $Me={bf 1}$ has a solution. I do not know if this makes things any easier.
    – Mike Earnest
    21 hours ago














2












2








2








We have a connected graph with $2n$ nodes. Prove that exsist spanning subgraph each node with odd degree.




Idea: Let $M$ be an adjacency matrix and work all over field $mathbb{Z}_2$. Then if $M$ is nonsingular we know that equation $$Mvec{s} = (1,1,1,....1,1)$$ has notrivial solution. Suppose set $S$ has incidence vector $vec{s}$. Then if for each node $a$ we color each edge in $N(a)cap S$ we win.



There are quite a few questions here. First, where did I use conectivity, second, is it $M$ really nonsingular and do we even need that and last, if all this is true does this aproach actually work?



Note: I already asked initaly question and did get an answer, so please answer just this.






linear-algebra combinatorics graph-theory algebraic-graph-theory algebraic-combinatorics







share|cite|improve this question
















We have a connected graph with $2n$ nodes. Prove that exsist spanning subgraph each node with odd degree.




Idea: Let $M$ be an adjacency matrix and work all over field $mathbb{Z}_2$. Then if $M$ is nonsingular we know that equation $$Mvec{s} = (1,1,1,....1,1)$$ has notrivial solution. Suppose set $S$ has incidence vector $vec{s}$. Then if for each node $a$ we color each edge in $N(a)cap S$ we win.



There are quite a few questions here. First, where did I use conectivity, second, is it $M$ really nonsingular and do we even need that and last, if all this is true does this aproach actually work?



Note: I already asked initaly question and did get an answer, so please answer just this.






linear-algebra combinatorics graph-theory algebraic-graph-theory algebraic-combinatorics




linear-algebra combinatorics graph-theory algebraic-graph-theory algebraic-combinatorics






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 2 days ago

























asked 2 days ago









greedoid

37.7k114794




37.7k114794












  • Sorry I am a bit confused, do you want an answer to the initial quoted question or are you only asking about your approach?
    – Vincenzo
    2 days ago










  • @Vincenzo second one.
    – greedoid
    2 days ago










  • I don't understand the question - clearly a simple path on $4$ vertices has an even number of vertices, but the only spanning subgraph (being the graph itself) has two vertices of even degree.
    – Math1000
    2 days ago










  • Take a look here. math.stackexchange.com/questions/3047513/… @Math1000
    – greedoid
    2 days ago






  • 1




    If you want a linear algebra solution, you should instead look at the incidence matrix of the graph and try to show that $Me={bf 1}$ has a solution. I do not know if this makes things any easier.
    – Mike Earnest
    21 hours ago


















  • Sorry I am a bit confused, do you want an answer to the initial quoted question or are you only asking about your approach?
    – Vincenzo
    2 days ago










  • @Vincenzo second one.
    – greedoid
    2 days ago










  • I don't understand the question - clearly a simple path on $4$ vertices has an even number of vertices, but the only spanning subgraph (being the graph itself) has two vertices of even degree.
    – Math1000
    2 days ago










  • Take a look here. math.stackexchange.com/questions/3047513/… @Math1000
    – greedoid
    2 days ago






  • 1




    If you want a linear algebra solution, you should instead look at the incidence matrix of the graph and try to show that $Me={bf 1}$ has a solution. I do not know if this makes things any easier.
    – Mike Earnest
    21 hours ago
















Sorry I am a bit confused, do you want an answer to the initial quoted question or are you only asking about your approach?
– Vincenzo
2 days ago




Sorry I am a bit confused, do you want an answer to the initial quoted question or are you only asking about your approach?
– Vincenzo
2 days ago












@Vincenzo second one.
– greedoid
2 days ago




@Vincenzo second one.
– greedoid
2 days ago












I don't understand the question - clearly a simple path on $4$ vertices has an even number of vertices, but the only spanning subgraph (being the graph itself) has two vertices of even degree.
– Math1000
2 days ago




I don't understand the question - clearly a simple path on $4$ vertices has an even number of vertices, but the only spanning subgraph (being the graph itself) has two vertices of even degree.
– Math1000
2 days ago












Take a look here. math.stackexchange.com/questions/3047513/… @Math1000
– greedoid
2 days ago




Take a look here. math.stackexchange.com/questions/3047513/… @Math1000
– greedoid
2 days ago




1




1




If you want a linear algebra solution, you should instead look at the incidence matrix of the graph and try to show that $Me={bf 1}$ has a solution. I do not know if this makes things any easier.
– Mike Earnest
21 hours ago




If you want a linear algebra solution, you should instead look at the incidence matrix of the graph and try to show that $Me={bf 1}$ has a solution. I do not know if this makes things any easier.
– Mike Earnest
21 hours ago










1 Answer
1






active

oldest

votes


















1














There are at least two gaps in the approach. We need an equation $Mvec{s} = (1,1,1,....1,1)$ to have a solution (and I don’t know what means “non-trivial” here). If the matrix $M$ is non-singular then this soluttion exists and is unique. But why in this case $vec{s}$ is an incidence vector of some set? Next, the adjacency matrix is singular for any graph which has two vertices with the same set of neighbors. For instance, for a cycle $C_4$ on four vertices.






share|cite|improve this answer























  • Anyway, do you have a perhaps an idea how to atack this algebraicly
    – greedoid
    2 days ago










  • You think this is hopless try with linear algebra?
    – greedoid
    yesterday











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%2f3052416%2fwe-have-a-connected-graph-with-2n-nodes-prove-that-exsist-spanning-subgraph-e%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














There are at least two gaps in the approach. We need an equation $Mvec{s} = (1,1,1,....1,1)$ to have a solution (and I don’t know what means “non-trivial” here). If the matrix $M$ is non-singular then this soluttion exists and is unique. But why in this case $vec{s}$ is an incidence vector of some set? Next, the adjacency matrix is singular for any graph which has two vertices with the same set of neighbors. For instance, for a cycle $C_4$ on four vertices.






share|cite|improve this answer























  • Anyway, do you have a perhaps an idea how to atack this algebraicly
    – greedoid
    2 days ago










  • You think this is hopless try with linear algebra?
    – greedoid
    yesterday
















1














There are at least two gaps in the approach. We need an equation $Mvec{s} = (1,1,1,....1,1)$ to have a solution (and I don’t know what means “non-trivial” here). If the matrix $M$ is non-singular then this soluttion exists and is unique. But why in this case $vec{s}$ is an incidence vector of some set? Next, the adjacency matrix is singular for any graph which has two vertices with the same set of neighbors. For instance, for a cycle $C_4$ on four vertices.






share|cite|improve this answer























  • Anyway, do you have a perhaps an idea how to atack this algebraicly
    – greedoid
    2 days ago










  • You think this is hopless try with linear algebra?
    – greedoid
    yesterday














1












1








1






There are at least two gaps in the approach. We need an equation $Mvec{s} = (1,1,1,....1,1)$ to have a solution (and I don’t know what means “non-trivial” here). If the matrix $M$ is non-singular then this soluttion exists and is unique. But why in this case $vec{s}$ is an incidence vector of some set? Next, the adjacency matrix is singular for any graph which has two vertices with the same set of neighbors. For instance, for a cycle $C_4$ on four vertices.






share|cite|improve this answer














There are at least two gaps in the approach. We need an equation $Mvec{s} = (1,1,1,....1,1)$ to have a solution (and I don’t know what means “non-trivial” here). If the matrix $M$ is non-singular then this soluttion exists and is unique. But why in this case $vec{s}$ is an incidence vector of some set? Next, the adjacency matrix is singular for any graph which has two vertices with the same set of neighbors. For instance, for a cycle $C_4$ on four vertices.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited 2 days ago









greedoid

37.7k114794




37.7k114794










answered 2 days ago









Alex Ravsky

38.8k32079




38.8k32079












  • Anyway, do you have a perhaps an idea how to atack this algebraicly
    – greedoid
    2 days ago










  • You think this is hopless try with linear algebra?
    – greedoid
    yesterday


















  • Anyway, do you have a perhaps an idea how to atack this algebraicly
    – greedoid
    2 days ago










  • You think this is hopless try with linear algebra?
    – greedoid
    yesterday
















Anyway, do you have a perhaps an idea how to atack this algebraicly
– greedoid
2 days ago




Anyway, do you have a perhaps an idea how to atack this algebraicly
– greedoid
2 days ago












You think this is hopless try with linear algebra?
– greedoid
yesterday




You think this is hopless try with linear algebra?
– greedoid
yesterday


















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.





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%2fmath.stackexchange.com%2fquestions%2f3052416%2fwe-have-a-connected-graph-with-2n-nodes-prove-that-exsist-spanning-subgraph-e%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

Human spaceflight

Image
Human spaceflight From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Space traveler" redirects here. For other uses, see Space traveler (disambiguation). @media all and (max-width:720px){.mw-parser-output .tmulti>.thumbinner{width:100%!important;max-width:none!important}.mw-parser-output .tmulti .tsingle{float:none!important;max-width:none!important;width:100%!important;text-align:center}} Apollo 11 crewmember Buzz Aldrin on the Moon, 1969 International Space Station crewmember Tracy Caldwell Dyson views the Earth, 2010 Space Shuttle Discovery heads into space with a crew aboard, STS-121 in 2006 Inside a space suit on the Canadarm, 1993 Human spaceflight (also referred to as crewed spaceflight or manned spaceflight ) is space travel with a crew or passengers aboard the spacecraft. Spacecraft carrying people may be operated directly, by human crew, or it may be e
Read more

Can not write log (Is /dev/pts mounted?) - openpty in Ubuntu-on-Windows?

Image
0 1 What exactly does the error message beginning with E: mean? I assume it has to do with the file structure on Ubuntu-on-Windows, but what exactly? The following package was automatically installed and is no longer required: os-prober Use 'apt-get autoremove' to remove it. The following extra packages will be installed: libxslt1.1 The following NEW packages will be installed: libxslt1.1 xmlstarlet 0 upgraded, 2 newly installed, 0 to remove and 0 not upgraded. Need to get 435 kB of archives. After this operation, 1023 kB of additional disk space will be used. Get:1 http://archive.ubuntu.com/ubuntu/ trusty/main libxslt1.1 amd64 1.1.28-2build1 [145 kB] Get:2 http://archive.ubuntu.com/ubuntu/ trusty/universe xmlstarlet amd64 1.5.0-1 [290 kB]
Read more

File:DeusFollowingSea.jpg

Image
File:DeusFollowingSea.jpg From Wikipedia, the free encyclopedia Jump to navigation Jump to search File File history File usage No higher resolution available. DeusFollowingSea.jpg ‎ (238 × 211 pixels, file size: 12 KB, MIME type: image/jpeg ) Summary [ edit ] Media data and Non-free use rationale Description Cover art of the Deus CD Following Sea Author or copyright owner Deus Source (WP:NFCC#4) rocksucker.co.uk Date of publication 2012 Use in article (WP:NFCC#7) Following Sea Purpose of use in article (WP:NFCC#8) to serve as the primary means of visual identification at the top of the article dedicated to the work in question. Not replaceable with free media because (WP:NFCC#1) n.a. Minimal use (WP:NFCC#3) Low res image used in infobox of the article on the album Respect for commercial opportunities (WP:NFCC#2) n.a. Fair use Fair use of co
Read more