Nick Brettell, On the graph width parameter mim-width
Maximum induced matching width, also known as mim-width, is a width parameter for graphs introduced by Vatshelle in 2012. This parameter can be defined over branch decompositions of a graph …
10 events found.
Virtual Discrete Math Colloquium
Events
-
-
Zoom ID: 869 4632 6610 (ibsdimag)
-
-
Sebastian Siebertz, Rank-width meets stability
Zoom ID: 869 4632 6610 (ibsdimag)Forbidden graph characterizations provide a convenient way of specifying graph classes, which often exhibit a rich combinatorial and algorithmic theory. A prime example in graph theory are classes of bounded …
-
Luke Postle, Further progress towards Hadwiger’s conjecture
Zoom ID: 869 4632 6610 (ibsdimag)In 1943, Hadwiger conjectured that every graph with no $K_t$ minor is $(t-1)$-colorable for every $t\ge 1$. In the 1980s, Kostochka and Thomason independently proved that every graph with no $K_t$ …
-
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 …
-
-
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 …
-
-
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$ …
-
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 …
-
Da Qi Chen, Bipartite Saturation
Zoom ID: 869 4632 6610 (ibsdimag)In extremal graph theory, a graph G is H-saturated if G does not contain a copy of H but adding any missing edge to G creates a copy of H. …
-
-
Deniz Sarikaya, What means Hamiltonicity for infinite graphs and how to force it via forbidden induced subgraphs
Zoom ID: 869 4632 6610 (ibsdimag)The study of Hamiltonian graphs, i.e. finite graphs having a cycle that contains all vertices of the graph, is a central theme of finite graph theory. For infinite graphs such …