Do any two spanning trees of a simple graph always have some common edges?











up vote
2
down vote

favorite












I tried few cases and found any two spanning tree of a simple graph has some common edges. I mean I couldn't find any counter example so far. But I couldn't prove or disprove this either. How to prove or disprove this conjecture?






graphs graph-theory spanning-trees







share|cite|improve this question






















  • Assuming the weights of the graph are distinct, the edge with the minimum weight will be present in all the minimum spanning trees.
    – Gokul
    3 hours ago










  • @Gokul minimum spanning tree? What?...
    – Mr. Sigma.
    2 hours ago










  • Oh, apologies. I read the title as whether minimum spanning tree have common edges.
    – Gokul
    2 hours ago















up vote
2
down vote

favorite












I tried few cases and found any two spanning tree of a simple graph has some common edges. I mean I couldn't find any counter example so far. But I couldn't prove or disprove this either. How to prove or disprove this conjecture?






graphs graph-theory spanning-trees







share|cite|improve this question






















  • Assuming the weights of the graph are distinct, the edge with the minimum weight will be present in all the minimum spanning trees.
    – Gokul
    3 hours ago










  • @Gokul minimum spanning tree? What?...
    – Mr. Sigma.
    2 hours ago










  • Oh, apologies. I read the title as whether minimum spanning tree have common edges.
    – Gokul
    2 hours ago













up vote
2
down vote

favorite









up vote
2
down vote

favorite











I tried few cases and found any two spanning tree of a simple graph has some common edges. I mean I couldn't find any counter example so far. But I couldn't prove or disprove this either. How to prove or disprove this conjecture?






graphs graph-theory spanning-trees







share|cite|improve this question













I tried few cases and found any two spanning tree of a simple graph has some common edges. I mean I couldn't find any counter example so far. But I couldn't prove or disprove this either. How to prove or disprove this conjecture?






graphs graph-theory spanning-trees




graphs graph-theory spanning-trees






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 3 hours ago









Mr. Sigma.

355116




355116












  • Assuming the weights of the graph are distinct, the edge with the minimum weight will be present in all the minimum spanning trees.
    – Gokul
    3 hours ago










  • @Gokul minimum spanning tree? What?...
    – Mr. Sigma.
    2 hours ago










  • Oh, apologies. I read the title as whether minimum spanning tree have common edges.
    – Gokul
    2 hours ago


















  • Assuming the weights of the graph are distinct, the edge with the minimum weight will be present in all the minimum spanning trees.
    – Gokul
    3 hours ago










  • @Gokul minimum spanning tree? What?...
    – Mr. Sigma.
    2 hours ago










  • Oh, apologies. I read the title as whether minimum spanning tree have common edges.
    – Gokul
    2 hours ago
















Assuming the weights of the graph are distinct, the edge with the minimum weight will be present in all the minimum spanning trees.
– Gokul
3 hours ago




Assuming the weights of the graph are distinct, the edge with the minimum weight will be present in all the minimum spanning trees.
– Gokul
3 hours ago












@Gokul minimum spanning tree? What?...
– Mr. Sigma.
2 hours ago




@Gokul minimum spanning tree? What?...
– Mr. Sigma.
2 hours ago












Oh, apologies. I read the title as whether minimum spanning tree have common edges.
– Gokul
2 hours ago




Oh, apologies. I read the title as whether minimum spanning tree have common edges.
– Gokul
2 hours ago










2 Answers
2






active

oldest

votes

















up vote
6
down vote



accepted










EDIT: This is incorrect as pointed out in the comments. As the other answer says, a spanning tree for $K_4$ can be done without sharing edges.



No, it's not true that any two spanning trees of a graph have common edges.



Consider the wheel graph:



enter image description here



You can make a spanning tree with edges "inside" the loop and another one from the outer loop.






share|cite|improve this answer























  • but the outer loop doesn't reach the center node
    – amI
    32 mins ago










  • You're right, I'll delete this answer as the other one suffices.
    – Gokul
    25 mins ago


















up vote
5
down vote













No, consider the complete graph $K_4$:



It has the following edge-disjoint spanning trees:
enter image description here






share|cite|improve this answer



















  • 2




    Oh! Elegant. Why I couldn't come upon this solution. ':O.
    – Mr. Sigma.
    1 hour 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: "419"
};
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f101038%2fdo-any-two-spanning-trees-of-a-simple-graph-always-have-some-common-edges%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
6
down vote



accepted










EDIT: This is incorrect as pointed out in the comments. As the other answer says, a spanning tree for $K_4$ can be done without sharing edges.



No, it's not true that any two spanning trees of a graph have common edges.



Consider the wheel graph:



enter image description here



You can make a spanning tree with edges "inside" the loop and another one from the outer loop.






share|cite|improve this answer























  • but the outer loop doesn't reach the center node
    – amI
    32 mins ago










  • You're right, I'll delete this answer as the other one suffices.
    – Gokul
    25 mins ago















up vote
6
down vote



accepted










EDIT: This is incorrect as pointed out in the comments. As the other answer says, a spanning tree for $K_4$ can be done without sharing edges.



No, it's not true that any two spanning trees of a graph have common edges.



Consider the wheel graph:



enter image description here



You can make a spanning tree with edges "inside" the loop and another one from the outer loop.






share|cite|improve this answer























  • but the outer loop doesn't reach the center node
    – amI
    32 mins ago










  • You're right, I'll delete this answer as the other one suffices.
    – Gokul
    25 mins ago













up vote
6
down vote



accepted







up vote
6
down vote



accepted






EDIT: This is incorrect as pointed out in the comments. As the other answer says, a spanning tree for $K_4$ can be done without sharing edges.



No, it's not true that any two spanning trees of a graph have common edges.



Consider the wheel graph:



enter image description here



You can make a spanning tree with edges "inside" the loop and another one from the outer loop.






share|cite|improve this answer














EDIT: This is incorrect as pointed out in the comments. As the other answer says, a spanning tree for $K_4$ can be done without sharing edges.



No, it's not true that any two spanning trees of a graph have common edges.



Consider the wheel graph:



enter image description here



You can make a spanning tree with edges "inside" the loop and another one from the outer loop.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited 24 mins ago

























answered 2 hours ago









Gokul

296110




296110












  • but the outer loop doesn't reach the center node
    – amI
    32 mins ago










  • You're right, I'll delete this answer as the other one suffices.
    – Gokul
    25 mins ago


















  • but the outer loop doesn't reach the center node
    – amI
    32 mins ago










  • You're right, I'll delete this answer as the other one suffices.
    – Gokul
    25 mins ago
















but the outer loop doesn't reach the center node
– amI
32 mins ago




but the outer loop doesn't reach the center node
– amI
32 mins ago












You're right, I'll delete this answer as the other one suffices.
– Gokul
25 mins ago




You're right, I'll delete this answer as the other one suffices.
– Gokul
25 mins ago










up vote
5
down vote













No, consider the complete graph $K_4$:



It has the following edge-disjoint spanning trees:
enter image description here






share|cite|improve this answer



















  • 2




    Oh! Elegant. Why I couldn't come upon this solution. ':O.
    – Mr. Sigma.
    1 hour ago















up vote
5
down vote













No, consider the complete graph $K_4$:



It has the following edge-disjoint spanning trees:
enter image description here






share|cite|improve this answer



















  • 2




    Oh! Elegant. Why I couldn't come upon this solution. ':O.
    – Mr. Sigma.
    1 hour ago













up vote
5
down vote










up vote
5
down vote









No, consider the complete graph $K_4$:



It has the following edge-disjoint spanning trees:
enter image description here






share|cite|improve this answer














No, consider the complete graph $K_4$:



It has the following edge-disjoint spanning trees:
enter image description here







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited 2 hours ago

























answered 2 hours ago









Bjørn Kjos-Hanssen

27417




27417








  • 2




    Oh! Elegant. Why I couldn't come upon this solution. ':O.
    – Mr. Sigma.
    1 hour ago














  • 2




    Oh! Elegant. Why I couldn't come upon this solution. ':O.
    – Mr. Sigma.
    1 hour ago








2




2




Oh! Elegant. Why I couldn't come upon this solution. ':O.
– Mr. Sigma.
1 hour ago




Oh! Elegant. Why I couldn't come upon this solution. ':O.
– Mr. Sigma.
1 hour ago


















draft saved

draft discarded




















































Thanks for contributing an answer to Computer Science 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%2fcs.stackexchange.com%2fquestions%2f101038%2fdo-any-two-spanning-trees-of-a-simple-graph-always-have-some-common-edges%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

Contact image not getting when fetch all contact list from iPhone by CNContact

Image
up vote 0 down vote favorite I know this question already asked but not getting solution. From this code I will get all the information from the contact but image not found when open vcf files on mac os, also not getting when share this file. I use this stackoverflow link here but It's not help full. var contacts = [CNContact]() let keys = [CNContactVCardSerialization.descriptorForRequiredKeys() ] as [Any] let request = CNContactFetchRequest(keysToFetch: keys as! [CNKeyDescriptor]) do { try self.contactStore.enumerateContacts(with: request) { (contact, stop) in // Array containing all unified contacts from everywhere contacts.append(contact) } } catch { print("unable to fetch contacts") } do { let data = try
Read more

count number of partitions of a set with n elements into k subsets

Image
up vote 6 down vote favorite 1 This program is for count number of partitions of a set with n elements into k subsets I am confusing here return k*countP(n-1, k) + countP(n-1, k-1); can some one explain what is happening here? why we are multiplying with k? NOTE->I know this is not the best way to calculate number of partitions that would be DP // A C++ program to count number of partitions // of a set with n elements into k subsets #include<iostream> using namespace std; // Returns count of different partitions of n // elements in k subsets int countP(int n, int k) { // Base cases if (n == 0 || k == 0 || k > n) return 0; if (k == 1 || k == n) return 1; // S(n+1, k) = k*S(n, k) + S(n, k-1) return k*countP(n-1, k) + countP(n-1, k-1); } // Driver program int ma
Read more

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