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

495




495












  • 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
    38 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
    38 mins ago










  • Understandable, it is the fault of my laziness in creating diagrams.
    – Zachary Hunter
    37 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
    38 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
    38 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
    38 mins ago


















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
















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




Thanks. I now wish to only have degree 3 vertices. I've made a new (hopefully final) question.
– Finallysignedup
38 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
    38 mins ago










  • Understandable, it is the fault of my laziness in creating diagrams.
    – Zachary Hunter
    37 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
    38 mins ago










  • Understandable, it is the fault of my laziness in creating diagrams.
    – Zachary Hunter
    37 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 1 hour 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
    38 mins ago










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


















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










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
















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




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












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




Understandable, it is the fault of my laziness in creating diagrams.
– Zachary Hunter
37 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

Bundesstraße 106

Image
Dieser Artikel beschreibt die Bundesstraße 106 in Deutschland. Zur gleichnamigen Straße in Österreich siehe Mölltal Straße. Vorlage:Infobox hochrangige Straße/Wartung/DE-B Bundesstraße 106 in Deutschland Karte Basisdaten Betreiber: Deutschland  Bundesrepublik Deutschland Straßenbeginn: Wismar ( 53° 54′  N , 11° 24′  O 53.900536 11.396875 ) Straßenende: Schwerin ( 53° 36′  N , 11° 24′  O 53.592785 11.404892 ) Gesamtlänge: 40,7 km Bundesland: Mecklenburg-Vorpommern Ausbauzustand: zweistreifig [1] Bundesstraße 106 in Schwerin (Umgehungsstraße) Straßenverlauf Land Mecklenburg-Vorpommern Landkreis Nordwestmecklenburg Ortsumgehung Wismar Wallensteingraben über   Dorf Mecklenburg Wallensteingraben Groß Stieten Bad Kleinen OT Niendorf Bahnstrecke Lübeck–Bad Kleinen Zickhusen Lübstorf Klein Trebbow OT Kirch Stück
Read more

Verónica Boquete

Image
Verónica Boquete im Trikot der Nationalmannschaft (2013) Personalia Name Verónica Boquete Giadans Geburtstag 9. April 1987 Geburtsort Santiago de Compostela, Spanien Größe 159 cm Position Mittelfeld / Sturm Juniorinnen Jahre Station 2001–2005 Xuventú Aguiño Frauen Jahre Station Spiele (Tore) 1 2005–2008 Prainsa Zaragoza 83 (40) 2008–2010 Espanyol Barcelona 53 (30) 2010 Buffalo Flash 9 0 (9) 2010 Chicago Red Stars 3 0 (1) 2010–2011 Espanyol Barcelona 26 (41) 2011 Philadelphia Independence 13 0 (5) 2011 Energija Woronesch 5 0 (1) 2012–2014 Tyresö FF 39 (14) 2014 Portland Thorns FC 15 0 (4) 2014–2015 1. FFC Frankfurt 23 0 (7) 2015–2016 FC Bayern München 9 0 (0) 2016–2018 Paris Saint-Germain 31 0 (8) 2018 Peking BG Phoenix 2019– Utah Royals FC 0 0 (0) Nationalmannschaft Jahre Auswahl
Read more

Ida-Boy-Ed-Garten

Image
Die Lage des Ida-Boy-Ed-Gartens, rot markiert Der Ida-Boy-Ed-Garten Der Ida-Boy-Ed-Garten, Blick von der Wakenitzmauer durch das Tor in der Stadtmauer Der Ida-Boy-Ed-Garten ist eine Straße der Lübecker Altstadt. Inhaltsverzeichnis 1 Lage 2 Geschichte 3 Literatur 4 Weblinks Lage | Der etwa 90 Meter lange Ida-Boy-Ed-Garten befindet sich an der nördlichen Spitze der Altstadtinsel, vor dem Burgtor. Die in einem Bogen durch eine Grünanlage hangaufwärts führende Straße verbindet die Wakenitzmauer mit der Burgtorbrücke. Geschichte | Der heutige Ida-Boy-Ed-Garten wurde ursprünglich als Verlängerung der Wakenitzmauer angelegt. 1903 wurde in den erhaltenen Teil der mittelalterlichen Stadtmauer, an dem die Wakenitzmauer bei der Einmündung der Kaiserstraße begann, ein Tor mit einem großen Bogen für die Durchführung der Straße und zwei kleineren seitlichen Öffnungen für Fußgänger gebrochen, um für die neu errichteten Wohnhäuser in diesem Bereich
Read more