Luke Postle, Further progress towards Hadwiger’s conjecture
Zoom ID: 869 4632 6610 (ibsdimag)In 1943, Hadwiger conjectured that every graph with no
10 events found.
Jinha Kim (김진하), Collapsibility of Non-Cover Complexes of Graphs
Room B232 IBS (기초과학연구원)Let
Zihan Tan, Towards Tight(er) Bounds for the Excluded Grid Theorem
Zoom ID: 869 4632 6610 (ibsdimag)We study the Excluded Grid Theorem, a fundamental structural result in graph theory, that was proved by Robertson and Seymour in their seminal work on graph minors. The theorem states that there is a function
Minki Kim (김민기), Complexes of graphs with bounded independence number
Room B232 IBS (기초과학연구원)Let
Hong Liu (刘鸿), Cycles and trees in graphs (1/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.
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.
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.
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.
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.
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.