• Livestream

    Hong Liu (刘鸿), Cycles and trees in graphs (2/8)

    Zoom ID:8628398170 (123450)

    This lecture series covers several different techniques on embedding paths/trees/cycles in (pseudo)random graphs/expanders as (induced) subgraphs.

  • Livestream

    Hong Liu (刘鸿), Cycles and trees in graphs (3/8)

    Zoom ID:8628398170 (123450)

    This lecture series covers several different techniques on embedding paths/trees/cycles in (pseudo)random graphs/expanders as (induced) subgraphs.

  • Livestream

    Hong Liu (刘鸿), Cycles and trees in graphs (4/8)

    Zoom ID:8628398170 (123450)

    This lecture series covers several different techniques on embedding paths/trees/cycles in (pseudo)random graphs/expanders as (induced) subgraphs.

  • Livestream

    Hong Liu (刘鸿), Cycles and trees in graphs (5/8)

    Zoom ID:8628398170 (123450)

    This lecture series covers several different techniques on embedding paths/trees/cycles in (pseudo)random graphs/expanders as (induced) subgraphs.

  • Livestream

    Hong Liu (刘鸿), Cycles and trees in graphs (6/8)

    Zoom ID:8628398170 (123450)

    This lecture series covers several different techniques on embedding paths/trees/cycles in (pseudo)random graphs/expanders as (induced) subgraphs.

  • Livestream

    Hong Liu (刘鸿), Cycles and trees in graphs (7/8)

    Zoom ID:8628398170 (123450)

    This lecture series covers several different techniques on embedding paths/trees/cycles in (pseudo)random graphs/expanders as (induced) subgraphs.

  • Livestream

    Hong Liu (刘鸿), Cycles and trees in graphs (8/8)

    Zoom ID:8628398170 (123450)

    This lecture series covers several different techniques on embedding paths/trees/cycles in (pseudo)random graphs/expanders as (induced) subgraphs.

  • Joonkyung Lee (이준경), On graph norms for complex-valued functions

    Room B232 IBS (기초과학연구원)

    For any given graph $H$, one may define a natural corresponding functional $\|.\|_H$ for real-valued functions by using homomorphism density. One may also extend this to complex-valued functions, once $H$ is paired with a $2$-edge-colouring $\alpha$ to assign conjugates. We say that $H$ is real-norming (resp. complex-norming) if $\|.\|_H$ (resp. there is $\alpha$ such that

  • Chun-Hung Liu (劉俊宏), Asymptotic dimension of minor-closed families and beyond

    Zoom ID:95464969835 (356260)

    The asymptotic dimension of metric spaces is an important notion in  geometric group theory. The metric spaces considered in this talk are  the ones whose underlying spaces are the vertex-sets of (edge-)weighted  graphs and whose metrics are the distance functions in weighted graphs.  A standard compactness argument shows that it suffices to consider the  asymptotic

  • Jeong Ok Choi (최정옥), Various game-theoretic models on graphs

    Room B232 IBS (기초과학연구원)

    We introduce some of well-known game-theoretic graph models and related problems. A contagion game model explains how an innovation diffuses over a given network structure and focuses on finding conditions on which structure an innovation becomes epidemic. Regular infinite graphs are interesting examples to explore. We show that regular infinite trees make an innovation least