清华主页 EN
导航菜单

Methods of Algebraic Topology in Graph Theory

来源: 11-01

时间:2023-11-01 ~ 2023-12-27 Wed 09:30-11:50

地点:A3-2a-302 Zoom: 427 154 2002 (PW: BIMSA)

主讲人:Yury Muranov (Visiting Scholar)

Introduction

Currently the problem of transferring results of algebraic topology to discrete objects and, in particular, to various categories of digraphs and graphs, is widely investigated. The main technical tools are given by the homotopy theory and various homology theories. We present the basic methods of algebraic topology in graph theory and describe relations between continious and discrete algebraic topology.


Prerequisite

Basic notions of algebra and topology


Reference

1. Grigor'yan A. A., Jimenez Rolando, Muranov Yu. V, Yau Sh.-T. On the path homology theory of digraphs and Eilenberg-Steenrod axioms. Homology, Homotopy and Applications, 2018. Vol. 20. P. 179-205.

2. Grigor'yan A. A., Yong Lin, Muranov Yu. V., Yau Sh.-T. Cohomology of digraphs and (undirected) graphs. Asian Journal of Mathematics, 2015, Vo. 19. No. 5, 887-932.

3. Grigor'yan A. A., Muranov Yu. V., Yau Sh.-T. Graphs associated with simplicial complexes. Homology, Homotopy, and Applications, 2014. Vol.16. 295-311.

4. Grigor'yan A. A., Muranov Yu. V., Yau Sh.-T. On a cohomology of digraphs and Hochschild cohomology. Journal of Homotopy and Related Structures, 2016. Vol. 11, no. 2. P. 209-230.

5. Grigor'yan A. A., Muranov Yu. V. On homology theories of cubical digraphs. Pasfic Journal of Mathematics, 2023. Vol 322. No. 1. https://doi.org/10.2140/pjm.2023.322.39


返回顶部
相关文章
  • Graph algorithm

    Record: NoLevel: GraduateLanguage: ChinesePrerequisiteDiscrete math.AbstractIn this course, we introduce basic concepts in graph theory and complexity theory, then study graph algorithms with a focus on matching and network flows.Reference1. Introduction to Graph Theory, by Douglas B. West.2. Modern Graph Theory, by Bela Bollobas.3. The Design and Analysis of Algorithms, by Dexter Kozen.Syllabu...

  • The chromatic profile of a graph

    AbstractDetermining the chromatic number of a graph is a difficult but important problem. Hence, it is not surprising that a variety of questions in Graph Theory concern the search for meaningful upper bounds for the chromatic number of certain families of graphs. One type of graph family that received considerable attention is that of H-free graphs, that is, the family of graphs G which do not...