EUVIMEDEUVIMED entdecken
Crossref

Higher discrete homotopy groups of graphs

Bob Lutz

Algebraic Combinatorics · 16.02.2021 · 4 (1) · 69-88

DOI: 10.5802/alco.151 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algebraic Combinatorics, online erschienen am 16.02.2021. Verfasst von Bob Lutz. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 13 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper studies a discrete homotopy theory for graphs introduced by Barcelo et al. We prove two main results. First we show that if G is a graph containing no 3- or 4-cycles, then the n th discrete homotopy group A n ( G ) is trivial for all n ≥ 2 . Second we exhibit for each n ≥ 1 a natural homomorphism ψ : A n ( G ) → ℋ n ( G ) , where ℋ n ( G ) is the n th discrete cubical singular homology group, and an infinite family of graphs G for which ℋ n ( G ) is nontrivial and ψ is surjective. It follows that for each n ≥ 1 there are graphs G for which A n ( G ) is nontrivial.

Zitieren

APA

Lutz, B. (2021). Higher discrete homotopy groups of graphs. Algebraic Combinatorics, 4(1), 69-88. https://doi.org/10.5802/alco.151

Vancouver

Lutz B. Higher discrete homotopy groups of graphs. Algebraic Combinatorics. 2021;4(1):69-88. doi:10.5802/alco.151

BibTeX
@article{Lutz2021,
  author = {Lutz, Bob},
  title = {Higher discrete homotopy groups of graphs},
  journal = {Algebraic Combinatorics},
  year = {2021},
  volume = {4},
  number = {1},
  pages = {69--88},
  doi = {10.5802/alco.151}
}
Kostenlos starten →