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

Jaeseong Oh (오재성), A 2-isomorphism theorem for delta-matroids

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

Whitney’s 2-Isomorphism Theorem characterises when two graphs have isomorphic cycle matroids. In this talk, we present an analogue of this theorem for graphs embedded in surfaces by characterising when two graphs in surface have isomorphic delta-matroids. This is based on the joint work with Iain Moffatt.

Daniel Cranston, Vertex Partitions into an Independent Set and a Forest with Each Component Small

Zoom ID: 869 4632 6610 (ibsdimag)

For each integer $k\ge 2$, we determine a sharp bound on $\operatorname{mad}(G)$ such that $V(G)$ can be partitioned into sets $I$ and $F_k$, where $I$ is an independent set and $G$ is a forest in which each component has at most k vertices. For each $k$ we construct an infinite family of examples showing our result is best

Casey Tompkins, Extremal forbidden poset problems in Boolean and linear lattices

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

Extending the classical theorem of Sperner on the maximum size of an antichain in the Boolean lattice, Katona and Tarján introduced a general extremal function $La(n,P)$, defined to be the maximum size of a family of subsets of $$ which does not contain a given poset $P$ among its containment relations.  In this talk, I

IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.