Mutually disjoint triangles in certain planar graph












1














Let G be a connected, planar graph for which every vertex has degree 3, except that one vertex has degree 2.



Is it possible to construct an example of such G whose only odd faces are triangles, and for which no two such triangles share a common vertex?



(For my purposes I may assume there are no faces of length 1 or 2, in which case there must be an odd face of length at least 3. By the handshake lemma, there are an even number of, hence at least 2, such odd faces.)






combinatorics discrete-mathematics graph-theory







share|cite|improve this question
























  • For my own edification.. what is an odd face ?
    – T. Ford
    1 hour ago










  • Face with odd number of sides.
    – Zachary Hunter
    1 hour ago










  • I think "those bounded by an odd length cycle" is a sensible definition.
    – Finallysignedup
    1 hour ago
















1














Let G be a connected, planar graph for which every vertex has degree 3, except that one vertex has degree 2.



Is it possible to construct an example of such G whose only odd faces are triangles, and for which no two such triangles share a common vertex?



(For my purposes I may assume there are no faces of length 1 or 2, in which case there must be an odd face of length at least 3. By the handshake lemma, there are an even number of, hence at least 2, such odd faces.)






combinatorics discrete-mathematics graph-theory







share|cite|improve this question
























  • For my own edification.. what is an odd face ?
    – T. Ford
    1 hour ago










  • Face with odd number of sides.
    – Zachary Hunter
    1 hour ago










  • I think "those bounded by an odd length cycle" is a sensible definition.
    – Finallysignedup
    1 hour ago














1












1








1







Let G be a connected, planar graph for which every vertex has degree 3, except that one vertex has degree 2.



Is it possible to construct an example of such G whose only odd faces are triangles, and for which no two such triangles share a common vertex?



(For my purposes I may assume there are no faces of length 1 or 2, in which case there must be an odd face of length at least 3. By the handshake lemma, there are an even number of, hence at least 2, such odd faces.)






combinatorics discrete-mathematics graph-theory







share|cite|improve this question















Let G be a connected, planar graph for which every vertex has degree 3, except that one vertex has degree 2.



Is it possible to construct an example of such G whose only odd faces are triangles, and for which no two such triangles share a common vertex?



(For my purposes I may assume there are no faces of length 1 or 2, in which case there must be an odd face of length at least 3. By the handshake lemma, there are an even number of, hence at least 2, such odd faces.)






combinatorics discrete-mathematics graph-theory




combinatorics discrete-mathematics graph-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 1 hour ago

























asked 1 hour ago









Finallysignedup

445




445












  • For my own edification.. what is an odd face ?
    – T. Ford
    1 hour ago










  • Face with odd number of sides.
    – Zachary Hunter
    1 hour ago










  • I think "those bounded by an odd length cycle" is a sensible definition.
    – Finallysignedup
    1 hour ago


















  • For my own edification.. what is an odd face ?
    – T. Ford
    1 hour ago










  • Face with odd number of sides.
    – Zachary Hunter
    1 hour ago










  • I think "those bounded by an odd length cycle" is a sensible definition.
    – Finallysignedup
    1 hour ago
















For my own edification.. what is an odd face ?
– T. Ford
1 hour ago




For my own edification.. what is an odd face ?
– T. Ford
1 hour ago












Face with odd number of sides.
– Zachary Hunter
1 hour ago




Face with odd number of sides.
– Zachary Hunter
1 hour ago












I think "those bounded by an odd length cycle" is a sensible definition.
– Finallysignedup
1 hour ago




I think "those bounded by an odd length cycle" is a sensible definition.
– Finallysignedup
1 hour ago










2 Answers
2






active

oldest

votes


















2














Here is one such graph - or, more precisely, one such plane embedding of a graph, since the lengths of the faces are not properties of the graph itself. It has two faces of length 3 (including the external face), two faces of length 4, and two faces of length 6.



enter image description here



(Motivation: we start with a triangular pyramid, which has all the required properties except for the degree-2 vertex, and modify it a little to make it work.)






share|cite|improve this answer





















  • Thanks. I now wish to only have degree 3 vertices. I've made a new (hopefully final) question.
    – Finallysignedup
    13 mins ago



















2














Take two cycles of the same order 2n+1, $C_a$ and $C_b$ and number each in clockwise fashion.



"Glue together" $v_{1a}$ and $v_{1b}$, and then do the same for $v_{2a}$ and $v_{2b}$, so that there is just one edge between $v_1$ and $v_2$.



Then, for each $i > 2$ create an edge between $v_{ia}$ and $v_{ib}$.



Finally, subdivide the edge between $v_1$ and $v_2$.






share|cite|improve this answer








New contributor




Zachary Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.


















  • Thanks. Sorry that I could not tick both answers.
    – Finallysignedup
    13 mins ago










  • Understandable, it is the fault of my laziness in creating diagrams.
    – Zachary Hunter
    12 mins 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',
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%2f3056515%2fmutually-disjoint-triangles-in-certain-planar-graph%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









2














Here is one such graph - or, more precisely, one such plane embedding of a graph, since the lengths of the faces are not properties of the graph itself. It has two faces of length 3 (including the external face), two faces of length 4, and two faces of length 6.



enter image description here



(Motivation: we start with a triangular pyramid, which has all the required properties except for the degree-2 vertex, and modify it a little to make it work.)






share|cite|improve this answer





















  • Thanks. I now wish to only have degree 3 vertices. I've made a new (hopefully final) question.
    – Finallysignedup
    13 mins ago
















2














Here is one such graph - or, more precisely, one such plane embedding of a graph, since the lengths of the faces are not properties of the graph itself. It has two faces of length 3 (including the external face), two faces of length 4, and two faces of length 6.



enter image description here



(Motivation: we start with a triangular pyramid, which has all the required properties except for the degree-2 vertex, and modify it a little to make it work.)






share|cite|improve this answer





















  • Thanks. I now wish to only have degree 3 vertices. I've made a new (hopefully final) question.
    – Finallysignedup
    13 mins ago














2












2








2






Here is one such graph - or, more precisely, one such plane embedding of a graph, since the lengths of the faces are not properties of the graph itself. It has two faces of length 3 (including the external face), two faces of length 4, and two faces of length 6.



enter image description here



(Motivation: we start with a triangular pyramid, which has all the required properties except for the degree-2 vertex, and modify it a little to make it work.)






share|cite|improve this answer












Here is one such graph - or, more precisely, one such plane embedding of a graph, since the lengths of the faces are not properties of the graph itself. It has two faces of length 3 (including the external face), two faces of length 4, and two faces of length 6.



enter image description here



(Motivation: we start with a triangular pyramid, which has all the required properties except for the degree-2 vertex, and modify it a little to make it work.)







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered 1 hour ago









Misha Lavrov

43.8k555104




43.8k555104












  • Thanks. I now wish to only have degree 3 vertices. I've made a new (hopefully final) question.
    – Finallysignedup
    13 mins ago


















  • Thanks. I now wish to only have degree 3 vertices. I've made a new (hopefully final) question.
    – Finallysignedup
    13 mins ago
















Thanks. I now wish to only have degree 3 vertices. I've made a new (hopefully final) question.
– Finallysignedup
13 mins ago




Thanks. I now wish to only have degree 3 vertices. I've made a new (hopefully final) question.
– Finallysignedup
13 mins ago











2














Take two cycles of the same order 2n+1, $C_a$ and $C_b$ and number each in clockwise fashion.



"Glue together" $v_{1a}$ and $v_{1b}$, and then do the same for $v_{2a}$ and $v_{2b}$, so that there is just one edge between $v_1$ and $v_2$.



Then, for each $i > 2$ create an edge between $v_{ia}$ and $v_{ib}$.



Finally, subdivide the edge between $v_1$ and $v_2$.






share|cite|improve this answer








New contributor




Zachary Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.


















  • Thanks. Sorry that I could not tick both answers.
    – Finallysignedup
    13 mins ago










  • Understandable, it is the fault of my laziness in creating diagrams.
    – Zachary Hunter
    12 mins ago
















2














Take two cycles of the same order 2n+1, $C_a$ and $C_b$ and number each in clockwise fashion.



"Glue together" $v_{1a}$ and $v_{1b}$, and then do the same for $v_{2a}$ and $v_{2b}$, so that there is just one edge between $v_1$ and $v_2$.



Then, for each $i > 2$ create an edge between $v_{ia}$ and $v_{ib}$.



Finally, subdivide the edge between $v_1$ and $v_2$.






share|cite|improve this answer








New contributor




Zachary Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.


















  • Thanks. Sorry that I could not tick both answers.
    – Finallysignedup
    13 mins ago










  • Understandable, it is the fault of my laziness in creating diagrams.
    – Zachary Hunter
    12 mins ago














2












2








2






Take two cycles of the same order 2n+1, $C_a$ and $C_b$ and number each in clockwise fashion.



"Glue together" $v_{1a}$ and $v_{1b}$, and then do the same for $v_{2a}$ and $v_{2b}$, so that there is just one edge between $v_1$ and $v_2$.



Then, for each $i > 2$ create an edge between $v_{ia}$ and $v_{ib}$.



Finally, subdivide the edge between $v_1$ and $v_2$.






share|cite|improve this answer








New contributor




Zachary Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









Take two cycles of the same order 2n+1, $C_a$ and $C_b$ and number each in clockwise fashion.



"Glue together" $v_{1a}$ and $v_{1b}$, and then do the same for $v_{2a}$ and $v_{2b}$, so that there is just one edge between $v_1$ and $v_2$.



Then, for each $i > 2$ create an edge between $v_{ia}$ and $v_{ib}$.



Finally, subdivide the edge between $v_1$ and $v_2$.







share|cite|improve this answer








New contributor




Zachary Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this answer



share|cite|improve this answer






New contributor




Zachary Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









answered 58 mins ago









Zachary Hunter

1245




1245




New contributor




Zachary Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Zachary Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Zachary Hunter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • Thanks. Sorry that I could not tick both answers.
    – Finallysignedup
    13 mins ago










  • Understandable, it is the fault of my laziness in creating diagrams.
    – Zachary Hunter
    12 mins ago


















  • Thanks. Sorry that I could not tick both answers.
    – Finallysignedup
    13 mins ago










  • Understandable, it is the fault of my laziness in creating diagrams.
    – Zachary Hunter
    12 mins ago
















Thanks. Sorry that I could not tick both answers.
– Finallysignedup
13 mins ago




Thanks. Sorry that I could not tick both answers.
– Finallysignedup
13 mins ago












Understandable, it is the fault of my laziness in creating diagrams.
– Zachary Hunter
12 mins ago




Understandable, it is the fault of my laziness in creating diagrams.
– Zachary Hunter
12 mins ago


















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%2f3056515%2fmutually-disjoint-triangles-in-certain-planar-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

Accessing regular linux commands in Huawei's Dopra Linux

Image
4 Backstory: I have a Huawei HG8245 router in my house and I want to change the default username/password. I've tried following this guide but the config file always gets reset. My ISP isn't helping either so I'm looking for other ways to accomplish this. The router has telnet access so this seems like a way to change the credentials. The first shell I gain access to looks like this: WAP> Pressing "?" gives me a list of available commands which I've pasted here, the two interesting ones are "su" and "shell". I can't seem to get su access, even after logging in as root (challenge password prompt, and then nothing happens), but shell gives me a proper linux shell. WAP>shell BusyBox v1.18.4 (2017-12-26 17:06:34 CST) built-in shell (ash) Enter 'hel
Read more

Can't connect RFCOMM socket: Host is down

Image
up vote 3 down vote favorite I have bluez 5.4.3 and I am attempting to communicate with a ble device through minicom. These two deceives (my computer and a bluno nano) are alreadt paired and this has been my method so far. #bluetoothctl # pair xx:xx:xx:xx:xx:xx # exit Everything is working well so far then... #sudo rfcomm connect /dev/rfcomm0 xx:xx:xx:xx:xx:xx 1 & [1] 3665 Can't connect RFCOMM socket: Host is down Does anyone know how to resolve this issue? Any help would be very much appreciated. bluetooth bluez share | improve this question asked Feb 9 '17 at 18:46 Brandon Knape 46 2
Read more

Kernel panic - not syncing: Fatal Exception in Interrupt

Image
0 Every day this error occured on my pc, kernel panic error on interrupt, what will be the problem? linux-mint share asked 6 mins ago Vinod Selvin Vinod Selvin 1 1 New contributor Vinod Selvin is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct. add a comment
Read more