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.
10 events found.
Seminars and Colloquiums
-
-
-
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$ …
-
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 …
-
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 …
-
-
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 …
-
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$ …
-
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 …
-
Meike Hatzel, Constant congestion bramble
Zoom ID: 869 4632 6610 (ibsdimag)In this talk I will present a small result we achieved during a workshop in February this year. My coauthors on this are Marcin Pilipczuk, Paweł Komosa and Manuel Sorge. A …
-
Yijia Chen (陈翌佳), Graphs of bounded shrub-depth, through a logic lens
Zoom ID: 869 4632 6610 (ibsdimag)Shrub-depth is a graph invariant often considered as an extension of tree-depth to dense graphs. In this talk I will explain our recent proofs of two results about graphs of …
-
Duksang Lee (이덕상), Characterizing matroids whose bases form graphic delta-matroids
Room B232 IBS (기초과학연구원)We introduce delta-graphic matroids, which are matroids whose bases form graphic delta-matroids. The class of delta-graphic matroids contains graphic matroids as well as cographic matroids and is a proper subclass …