Joonkyung Lee (이준경), Majority dynamics on sparse random graphs
Room B232 IBS (기초과학연구원)Majority dynamics on a graph
10 events found.
Young Researchers in Extremal and Probabilistic Combinatorics
Zoom ID: 554 788 7710 (507464)The aim of the Young Researchers in Extremal and Probabilistic Combinatorics is to bring together early career researchers working on these topics. The workshop will consist of several 25 minute …
Donggyu Kim (김동규), 𝝘-graphic delta-matroids and their applications
Room B232 IBS (기초과학연구원)Bouchet (1987) defined delta-matroids by relaxing the base exchange axiom of matroids. Oum (2009) introduced a graphic delta-matroid from a pair of a graph and its vertex subset. We define …
Ben Lund, Maximal 3-wise intersecting families
Room B232 IBS (기초과학연구원)A family
Martin Milanič, Tree Decompositions with Bounded Independence Number
Zoom ID: 869 4632 6610 (ibsdimag)The independence number of a tree decomposition
Jaehoon Kim (김재훈), 2-complexes with unique embeddings in 3-space
Room B232 IBS (기초과학연구원)A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connected 2-complex every link graph …
Sebastian Wiederrecht, Matching Minors in Bipartite Graphs
Zoom ID: 869 4632 6610 (ibsdimag)Matching minors are a specialisation of minors which preserves the existence and elementary structural properties of perfect matchings. They were first discovered as part of the study of the Pfaffian …
Graph Product Structure Theory: Gathering of Participants from Korea
Room B223 IBS (기초과학연구원)On November 22-26, 2021, there is a "Graph Product Structure Theory" workshop in BIRS Centre in Banff (https://www.birs.ca/events/2021/5-day-workshops/21w5235), organized in a hybrid manner with 15 onsite participants and around 50 …
Casey Tompkins, Ramsey numbers of Boolean lattices
Room B232 IBS (기초과학연구원)The poset Ramsey number
Tuukka Korhonen, Fast FPT-Approximation of Branchwidth
Zoom ID: 869 4632 6610 (ibsdimag)Branchwidth determines how graphs, and more generally, arbitrary connectivity (basically symmetric and submodular) functions could be decomposed into a tree-like structure by specific cuts. We develop a general framework for …