Finite graph homotopically equivalent to wedge sum of finite circle.












1












$begingroup$


Show that if X is a finite graph i.e. a graph with finitely many vertices and finitely many
edges, then X is homotopically equivalent to wedge sum of finitely circles.



I know that I will be able to make the connected components of finite graph homotopically equivalents to wedge sum of finite circles as I can shrink few edges but how do I proceed further










share|cite|improve this question









$endgroup$












  • $begingroup$
    You have to show that contracting an edge $Gto G/e$ is a homotopy equivalence. This can be done by hand, and is surprisingly tricky. You need to define maps in both directions (in the definition of homotopy equivalence), and defining the map from $G/eto G$ is the tricky bit but if you think about it, there aren't that many ways to do it. You could also appeal to more general theorems that state that contracting contractible subspaces yield homotopy equivalences under favorable circumstances. It depends what theorems you have access to.
    $endgroup$
    – Cheerful Parsnip
    Dec 1 '18 at 5:24












  • $begingroup$
    See math.stackexchange.com/questions/21705/…
    $endgroup$
    – Cheerful Parsnip
    Dec 1 '18 at 7:26
















1












$begingroup$


Show that if X is a finite graph i.e. a graph with finitely many vertices and finitely many
edges, then X is homotopically equivalent to wedge sum of finitely circles.



I know that I will be able to make the connected components of finite graph homotopically equivalents to wedge sum of finite circles as I can shrink few edges but how do I proceed further










share|cite|improve this question









$endgroup$












  • $begingroup$
    You have to show that contracting an edge $Gto G/e$ is a homotopy equivalence. This can be done by hand, and is surprisingly tricky. You need to define maps in both directions (in the definition of homotopy equivalence), and defining the map from $G/eto G$ is the tricky bit but if you think about it, there aren't that many ways to do it. You could also appeal to more general theorems that state that contracting contractible subspaces yield homotopy equivalences under favorable circumstances. It depends what theorems you have access to.
    $endgroup$
    – Cheerful Parsnip
    Dec 1 '18 at 5:24












  • $begingroup$
    See math.stackexchange.com/questions/21705/…
    $endgroup$
    – Cheerful Parsnip
    Dec 1 '18 at 7:26














1












1








1





$begingroup$


Show that if X is a finite graph i.e. a graph with finitely many vertices and finitely many
edges, then X is homotopically equivalent to wedge sum of finitely circles.



I know that I will be able to make the connected components of finite graph homotopically equivalents to wedge sum of finite circles as I can shrink few edges but how do I proceed further










share|cite|improve this question









$endgroup$




Show that if X is a finite graph i.e. a graph with finitely many vertices and finitely many
edges, then X is homotopically equivalent to wedge sum of finitely circles.



I know that I will be able to make the connected components of finite graph homotopically equivalents to wedge sum of finite circles as I can shrink few edges but how do I proceed further







algebraic-topology






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Oct 16 '16 at 12:16









scotscot

62




62












  • $begingroup$
    You have to show that contracting an edge $Gto G/e$ is a homotopy equivalence. This can be done by hand, and is surprisingly tricky. You need to define maps in both directions (in the definition of homotopy equivalence), and defining the map from $G/eto G$ is the tricky bit but if you think about it, there aren't that many ways to do it. You could also appeal to more general theorems that state that contracting contractible subspaces yield homotopy equivalences under favorable circumstances. It depends what theorems you have access to.
    $endgroup$
    – Cheerful Parsnip
    Dec 1 '18 at 5:24












  • $begingroup$
    See math.stackexchange.com/questions/21705/…
    $endgroup$
    – Cheerful Parsnip
    Dec 1 '18 at 7:26


















  • $begingroup$
    You have to show that contracting an edge $Gto G/e$ is a homotopy equivalence. This can be done by hand, and is surprisingly tricky. You need to define maps in both directions (in the definition of homotopy equivalence), and defining the map from $G/eto G$ is the tricky bit but if you think about it, there aren't that many ways to do it. You could also appeal to more general theorems that state that contracting contractible subspaces yield homotopy equivalences under favorable circumstances. It depends what theorems you have access to.
    $endgroup$
    – Cheerful Parsnip
    Dec 1 '18 at 5:24












  • $begingroup$
    See math.stackexchange.com/questions/21705/…
    $endgroup$
    – Cheerful Parsnip
    Dec 1 '18 at 7:26
















$begingroup$
You have to show that contracting an edge $Gto G/e$ is a homotopy equivalence. This can be done by hand, and is surprisingly tricky. You need to define maps in both directions (in the definition of homotopy equivalence), and defining the map from $G/eto G$ is the tricky bit but if you think about it, there aren't that many ways to do it. You could also appeal to more general theorems that state that contracting contractible subspaces yield homotopy equivalences under favorable circumstances. It depends what theorems you have access to.
$endgroup$
– Cheerful Parsnip
Dec 1 '18 at 5:24






$begingroup$
You have to show that contracting an edge $Gto G/e$ is a homotopy equivalence. This can be done by hand, and is surprisingly tricky. You need to define maps in both directions (in the definition of homotopy equivalence), and defining the map from $G/eto G$ is the tricky bit but if you think about it, there aren't that many ways to do it. You could also appeal to more general theorems that state that contracting contractible subspaces yield homotopy equivalences under favorable circumstances. It depends what theorems you have access to.
$endgroup$
– Cheerful Parsnip
Dec 1 '18 at 5:24














$begingroup$
See math.stackexchange.com/questions/21705/…
$endgroup$
– Cheerful Parsnip
Dec 1 '18 at 7:26




$begingroup$
See math.stackexchange.com/questions/21705/…
$endgroup$
– Cheerful Parsnip
Dec 1 '18 at 7:26










2 Answers
2






active

oldest

votes


















0












$begingroup$

Intuition goes something like this:



Let $X$ be a finite connected graph. Every tree is contractible, (deformation retractable to a point), therefore if $X$ is a tree then $X simeq 0$.
Otherwise, consider chordless cycles of $X$, (cycles that don't have subcycles). Any chordless cycle is homotopy equivalent to $S^1$.



Edge is a tree, so for any two chordless cycles sharing an edge, the edge contracts to a point, resulting in homotopy equivalency to $S^1 vee S^1$. Same goes for $n$ cycles. Therefore, everything besides chordless cycles contracts to a point $x_0$ at which all of $X$'s chordless cycles are wedged at.



Concatenation of trees and chordless cycles makes up any finite graph.
Therefore, any finite graph $X$ with $n$ chordless cycles:
$$X simeq underbrace{S^1 vee S^1 vee cdots vee S^1}_{ntext{ times}}$$






share|cite|improve this answer











$endgroup$





















    0












    $begingroup$

    Similar idea as in Eetu Koskela's answer.



    Just want to point out that one can refer to Example 1.22 and section 1.B in Hatcher's Algebraic Topology.



    First look for a spanning tree of the connected graph. Then use Seifert-van Kampen theorem (where we deformation retract things), we can see that the fundamental group of the graph is a free group, say $F_n$. Take the wedge sum of $n$ circles, and its fundamental group is also $F_n$. Since both our graph and the wedge sum of finite circles (essentially also a connected graph, with loops) are CW complex $K(G,1)$ that have the same fundamental group, they are homotopy equivalent.






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      This is a bit high-powered given the likely context of what OP knows.
      $endgroup$
      – Joshua Mundinger
      Dec 1 '18 at 5:26










    • $begingroup$
      Probably yes... I was just searching for similar questions and kind of want to write an answer for myself or if by any chance it can help the community.
      $endgroup$
      – chikurin
      Dec 1 '18 at 5:33











    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%2f1970909%2ffinite-graph-homotopically-equivalent-to-wedge-sum-of-finite-circle%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









    0












    $begingroup$

    Intuition goes something like this:



    Let $X$ be a finite connected graph. Every tree is contractible, (deformation retractable to a point), therefore if $X$ is a tree then $X simeq 0$.
    Otherwise, consider chordless cycles of $X$, (cycles that don't have subcycles). Any chordless cycle is homotopy equivalent to $S^1$.



    Edge is a tree, so for any two chordless cycles sharing an edge, the edge contracts to a point, resulting in homotopy equivalency to $S^1 vee S^1$. Same goes for $n$ cycles. Therefore, everything besides chordless cycles contracts to a point $x_0$ at which all of $X$'s chordless cycles are wedged at.



    Concatenation of trees and chordless cycles makes up any finite graph.
    Therefore, any finite graph $X$ with $n$ chordless cycles:
    $$X simeq underbrace{S^1 vee S^1 vee cdots vee S^1}_{ntext{ times}}$$






    share|cite|improve this answer











    $endgroup$


















      0












      $begingroup$

      Intuition goes something like this:



      Let $X$ be a finite connected graph. Every tree is contractible, (deformation retractable to a point), therefore if $X$ is a tree then $X simeq 0$.
      Otherwise, consider chordless cycles of $X$, (cycles that don't have subcycles). Any chordless cycle is homotopy equivalent to $S^1$.



      Edge is a tree, so for any two chordless cycles sharing an edge, the edge contracts to a point, resulting in homotopy equivalency to $S^1 vee S^1$. Same goes for $n$ cycles. Therefore, everything besides chordless cycles contracts to a point $x_0$ at which all of $X$'s chordless cycles are wedged at.



      Concatenation of trees and chordless cycles makes up any finite graph.
      Therefore, any finite graph $X$ with $n$ chordless cycles:
      $$X simeq underbrace{S^1 vee S^1 vee cdots vee S^1}_{ntext{ times}}$$






      share|cite|improve this answer











      $endgroup$
















        0












        0








        0





        $begingroup$

        Intuition goes something like this:



        Let $X$ be a finite connected graph. Every tree is contractible, (deformation retractable to a point), therefore if $X$ is a tree then $X simeq 0$.
        Otherwise, consider chordless cycles of $X$, (cycles that don't have subcycles). Any chordless cycle is homotopy equivalent to $S^1$.



        Edge is a tree, so for any two chordless cycles sharing an edge, the edge contracts to a point, resulting in homotopy equivalency to $S^1 vee S^1$. Same goes for $n$ cycles. Therefore, everything besides chordless cycles contracts to a point $x_0$ at which all of $X$'s chordless cycles are wedged at.



        Concatenation of trees and chordless cycles makes up any finite graph.
        Therefore, any finite graph $X$ with $n$ chordless cycles:
        $$X simeq underbrace{S^1 vee S^1 vee cdots vee S^1}_{ntext{ times}}$$






        share|cite|improve this answer











        $endgroup$



        Intuition goes something like this:



        Let $X$ be a finite connected graph. Every tree is contractible, (deformation retractable to a point), therefore if $X$ is a tree then $X simeq 0$.
        Otherwise, consider chordless cycles of $X$, (cycles that don't have subcycles). Any chordless cycle is homotopy equivalent to $S^1$.



        Edge is a tree, so for any two chordless cycles sharing an edge, the edge contracts to a point, resulting in homotopy equivalency to $S^1 vee S^1$. Same goes for $n$ cycles. Therefore, everything besides chordless cycles contracts to a point $x_0$ at which all of $X$'s chordless cycles are wedged at.



        Concatenation of trees and chordless cycles makes up any finite graph.
        Therefore, any finite graph $X$ with $n$ chordless cycles:
        $$X simeq underbrace{S^1 vee S^1 vee cdots vee S^1}_{ntext{ times}}$$







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Feb 28 '18 at 23:25

























        answered Feb 28 '18 at 22:47









        Eetu KoskelaEetu Koskela

        708




        708























            0












            $begingroup$

            Similar idea as in Eetu Koskela's answer.



            Just want to point out that one can refer to Example 1.22 and section 1.B in Hatcher's Algebraic Topology.



            First look for a spanning tree of the connected graph. Then use Seifert-van Kampen theorem (where we deformation retract things), we can see that the fundamental group of the graph is a free group, say $F_n$. Take the wedge sum of $n$ circles, and its fundamental group is also $F_n$. Since both our graph and the wedge sum of finite circles (essentially also a connected graph, with loops) are CW complex $K(G,1)$ that have the same fundamental group, they are homotopy equivalent.






            share|cite|improve this answer











            $endgroup$













            • $begingroup$
              This is a bit high-powered given the likely context of what OP knows.
              $endgroup$
              – Joshua Mundinger
              Dec 1 '18 at 5:26










            • $begingroup$
              Probably yes... I was just searching for similar questions and kind of want to write an answer for myself or if by any chance it can help the community.
              $endgroup$
              – chikurin
              Dec 1 '18 at 5:33
















            0












            $begingroup$

            Similar idea as in Eetu Koskela's answer.



            Just want to point out that one can refer to Example 1.22 and section 1.B in Hatcher's Algebraic Topology.



            First look for a spanning tree of the connected graph. Then use Seifert-van Kampen theorem (where we deformation retract things), we can see that the fundamental group of the graph is a free group, say $F_n$. Take the wedge sum of $n$ circles, and its fundamental group is also $F_n$. Since both our graph and the wedge sum of finite circles (essentially also a connected graph, with loops) are CW complex $K(G,1)$ that have the same fundamental group, they are homotopy equivalent.






            share|cite|improve this answer











            $endgroup$













            • $begingroup$
              This is a bit high-powered given the likely context of what OP knows.
              $endgroup$
              – Joshua Mundinger
              Dec 1 '18 at 5:26










            • $begingroup$
              Probably yes... I was just searching for similar questions and kind of want to write an answer for myself or if by any chance it can help the community.
              $endgroup$
              – chikurin
              Dec 1 '18 at 5:33














            0












            0








            0





            $begingroup$

            Similar idea as in Eetu Koskela's answer.



            Just want to point out that one can refer to Example 1.22 and section 1.B in Hatcher's Algebraic Topology.



            First look for a spanning tree of the connected graph. Then use Seifert-van Kampen theorem (where we deformation retract things), we can see that the fundamental group of the graph is a free group, say $F_n$. Take the wedge sum of $n$ circles, and its fundamental group is also $F_n$. Since both our graph and the wedge sum of finite circles (essentially also a connected graph, with loops) are CW complex $K(G,1)$ that have the same fundamental group, they are homotopy equivalent.






            share|cite|improve this answer











            $endgroup$



            Similar idea as in Eetu Koskela's answer.



            Just want to point out that one can refer to Example 1.22 and section 1.B in Hatcher's Algebraic Topology.



            First look for a spanning tree of the connected graph. Then use Seifert-van Kampen theorem (where we deformation retract things), we can see that the fundamental group of the graph is a free group, say $F_n$. Take the wedge sum of $n$ circles, and its fundamental group is also $F_n$. Since both our graph and the wedge sum of finite circles (essentially also a connected graph, with loops) are CW complex $K(G,1)$ that have the same fundamental group, they are homotopy equivalent.







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited Dec 1 '18 at 5:23

























            answered Dec 1 '18 at 5:09









            chikurinchikurin

            899




            899












            • $begingroup$
              This is a bit high-powered given the likely context of what OP knows.
              $endgroup$
              – Joshua Mundinger
              Dec 1 '18 at 5:26










            • $begingroup$
              Probably yes... I was just searching for similar questions and kind of want to write an answer for myself or if by any chance it can help the community.
              $endgroup$
              – chikurin
              Dec 1 '18 at 5:33


















            • $begingroup$
              This is a bit high-powered given the likely context of what OP knows.
              $endgroup$
              – Joshua Mundinger
              Dec 1 '18 at 5:26










            • $begingroup$
              Probably yes... I was just searching for similar questions and kind of want to write an answer for myself or if by any chance it can help the community.
              $endgroup$
              – chikurin
              Dec 1 '18 at 5:33
















            $begingroup$
            This is a bit high-powered given the likely context of what OP knows.
            $endgroup$
            – Joshua Mundinger
            Dec 1 '18 at 5:26




            $begingroup$
            This is a bit high-powered given the likely context of what OP knows.
            $endgroup$
            – Joshua Mundinger
            Dec 1 '18 at 5:26












            $begingroup$
            Probably yes... I was just searching for similar questions and kind of want to write an answer for myself or if by any chance it can help the community.
            $endgroup$
            – chikurin
            Dec 1 '18 at 5:33




            $begingroup$
            Probably yes... I was just searching for similar questions and kind of want to write an answer for myself or if by any chance it can help the community.
            $endgroup$
            – chikurin
            Dec 1 '18 at 5:33


















            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.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1970909%2ffinite-graph-homotopically-equivalent-to-wedge-sum-of-finite-circle%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

            Mont Emei

            Province de Neuquén

            Journaliste