Planar graph or not (Kuratowski's Theorem)

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












Graph planar or not



So the question is whether the graph given is planar or not. After some trial and error I think it is NOT planar, so I want to prove it using Kuratowski's Theorem but I couldn't break it down to $K_5$ or $K_3,3$. Would appreciate any help on this!



Also in general, is there any strategy that we can use when trying to apply Kuratowski's Theorem? Or any thing that can help to determine whether we should aim for $K_5$ or $K_3,3$? Or is it just purely trial and error? I got so frustrated when I could not figure it out.






discrete-mathematics graph-theory planar-graph







share|cite|improve this question





















  • What version of Kuratowski do you use: the one with minors? or subgraphs by subdivisions?
    – Henno Brandsma
    3 hours ago






  • 3




    There aren't too many points of degree 4, so I'd say go for $K_3,3$,
    – Henno Brandsma
    3 hours ago














up vote
1
down vote

favorite












Graph planar or not



So the question is whether the graph given is planar or not. After some trial and error I think it is NOT planar, so I want to prove it using Kuratowski's Theorem but I couldn't break it down to $K_5$ or $K_3,3$. Would appreciate any help on this!



Also in general, is there any strategy that we can use when trying to apply Kuratowski's Theorem? Or any thing that can help to determine whether we should aim for $K_5$ or $K_3,3$? Or is it just purely trial and error? I got so frustrated when I could not figure it out.






discrete-mathematics graph-theory planar-graph







share|cite|improve this question





















  • What version of Kuratowski do you use: the one with minors? or subgraphs by subdivisions?
    – Henno Brandsma
    3 hours ago






  • 3




    There aren't too many points of degree 4, so I'd say go for $K_3,3$,
    – Henno Brandsma
    3 hours ago












up vote
1
down vote

favorite









up vote
1
down vote

favorite











Graph planar or not



So the question is whether the graph given is planar or not. After some trial and error I think it is NOT planar, so I want to prove it using Kuratowski's Theorem but I couldn't break it down to $K_5$ or $K_3,3$. Would appreciate any help on this!



Also in general, is there any strategy that we can use when trying to apply Kuratowski's Theorem? Or any thing that can help to determine whether we should aim for $K_5$ or $K_3,3$? Or is it just purely trial and error? I got so frustrated when I could not figure it out.






discrete-mathematics graph-theory planar-graph







share|cite|improve this question













Graph planar or not



So the question is whether the graph given is planar or not. After some trial and error I think it is NOT planar, so I want to prove it using Kuratowski's Theorem but I couldn't break it down to $K_5$ or $K_3,3$. Would appreciate any help on this!



Also in general, is there any strategy that we can use when trying to apply Kuratowski's Theorem? Or any thing that can help to determine whether we should aim for $K_5$ or $K_3,3$? Or is it just purely trial and error? I got so frustrated when I could not figure it out.






discrete-mathematics graph-theory planar-graph




discrete-mathematics graph-theory planar-graph






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 3 hours ago









M. W

375




375











  • What version of Kuratowski do you use: the one with minors? or subgraphs by subdivisions?
    – Henno Brandsma
    3 hours ago






  • 3




    There aren't too many points of degree 4, so I'd say go for $K_3,3$,
    – Henno Brandsma
    3 hours ago
















  • What version of Kuratowski do you use: the one with minors? or subgraphs by subdivisions?
    – Henno Brandsma
    3 hours ago






  • 3




    There aren't too many points of degree 4, so I'd say go for $K_3,3$,
    – Henno Brandsma
    3 hours ago















What version of Kuratowski do you use: the one with minors? or subgraphs by subdivisions?
– Henno Brandsma
3 hours ago




What version of Kuratowski do you use: the one with minors? or subgraphs by subdivisions?
– Henno Brandsma
3 hours ago




3




3




There aren't too many points of degree 4, so I'd say go for $K_3,3$,
– Henno Brandsma
3 hours ago




There aren't too many points of degree 4, so I'd say go for $K_3,3$,
– Henno Brandsma
3 hours ago










1 Answer
1






active

oldest

votes

















up vote
5
down vote



accepted










Remove the edge $BD$ and suppress vertices $B,D$. The original graph thus contains a subdivision of this resulting graph, which is isomorphic to $K_3,3$, so the original graph is not planar.






share|cite|improve this answer




















  • Thanks for your answer!
    – M. W
    26 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',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
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%2f2973019%2fplanar-graph-or-not-kuratowskis-theorem%23new-answer', 'question_page');

);

Post as a guest

















1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
5
down vote



accepted










Remove the edge $BD$ and suppress vertices $B,D$. The original graph thus contains a subdivision of this resulting graph, which is isomorphic to $K_3,3$, so the original graph is not planar.






share|cite|improve this answer




















  • Thanks for your answer!
    – M. W
    26 mins ago














up vote
5
down vote



accepted










Remove the edge $BD$ and suppress vertices $B,D$. The original graph thus contains a subdivision of this resulting graph, which is isomorphic to $K_3,3$, so the original graph is not planar.






share|cite|improve this answer




















  • Thanks for your answer!
    – M. W
    26 mins ago












up vote
5
down vote



accepted







up vote
5
down vote



accepted






Remove the edge $BD$ and suppress vertices $B,D$. The original graph thus contains a subdivision of this resulting graph, which is isomorphic to $K_3,3$, so the original graph is not planar.






share|cite|improve this answer












Remove the edge $BD$ and suppress vertices $B,D$. The original graph thus contains a subdivision of this resulting graph, which is isomorphic to $K_3,3$, so the original graph is not planar.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered 3 hours ago









Parcly Taxel

37.6k137096




37.6k137096











  • Thanks for your answer!
    – M. W
    26 mins ago
















  • Thanks for your answer!
    – M. W
    26 mins ago















Thanks for your answer!
– M. W
26 mins ago




Thanks for your answer!
– M. W
26 mins ago

















 

draft saved


draft discarded















































 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2973019%2fplanar-graph-or-not-kuratowskis-theorem%23new-answer', 'question_page');

);

Post as a guest
































































Comments

Post a Comment

Popular posts from this blog

What does second last employer means? [closed]

Image
Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote -3 down vote favorite Say, for example I have worked in the following companies, Company A => 2010 - 2011 Company B => 2011 - 2012 Company C => 2012 - Till Date Company D => Have offer Now assume Company D is asking to submit documents from my second last employer. So from the list of companies given, which company would be qualified as second last employer? software-industry employer share | improve this question asked Aug 10 '14 at 5:16 Rajaprabhu Aravindasamy 559 1 6 13 closed as off-topic by Jim G., jmort253 ♦ Aug 11 '14 at 1:58 This question appears to be off-topic. The users who voted to close gave this specific reason: "Questions seeking advice on company-specific regulations, agreements, or policies should be directed to your manager or HR department. Questions that address...
Read more

Installing NextGIS Connect into QGIS 3?

Image
Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote 1 down vote favorite Just acquired free version of NEXTGIS and trying to install the plugin for QGIS. It tells me it was not designed for version 3 of QGIS. How do I set up the QGIS-NEXTGIS interface then? qgis qgis-plugins nextgis share | improve this question edited 3 hours ago PolyGeo ♦ 51.9k 17 77 233 asked 4 hours ago IanGS 16 4 New contributor IanGS 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  |  up vote 1 down vote favorite Just acquired free version of NEXTGIS and trying to install the plugin for QGIS. It tells me it was not designed for version 3 of QGIS. How do I set up the QGIS-NEXTGIS interface then? qgis qgis-plugin...
Read more

One-line joke

A one-liner is a joke that is delivered in a single line. A good one-liner is said to be pithy - concise and meaningful. [1] Comedians and actors use this comedic method as part of their act, e.g. Jimmy Carr, Tommy Cooper, Rodney Dangerfield, Norm Macdonald, Ken Dodd, Stewart Francis, Zach Galifianakis, Mitch Hedberg, Anthony Jeselnik, Milton Jones, Shappi Khorsandi, Jay London, Mark Linn-Baker, Demetri Martin, Groucho Marx, Dan Mintz, Emo Philips, Tim Vine, Steven Wright and Henny Youngman and Arnold Schwarzenegger. [ citation needed ] Many fictional characters are also known to deliver one-liners, including James Bond, who usually includes pithy and laconic quips after disposing of a villain. [ citation needed ] Examples "A baby seal walks into a club." "A dyslexic man walks into a bra." (Anonymous) "There are three types of people, those who can count and those who can't." "Venison's dear, isn't it?" (Jimmy Carr) "An escala...
Read more