Martin Milanič, Tree Decompositions with Bounded Independence Number
Zoom ID: 869 4632 6610 (ibsdimag)The independence number of a tree decomposition
The independence number of a tree decomposition
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 …
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 …
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 …
The poset Ramsey number
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 …
What is the largest number
The independent domination number of a graph
I will discuss various results for rainbow matching problems. In particular, I will introduce a ‘sampling trick’ which can be used to obtain short proofs of old results as well …
We give some natural sufficient conditions for balls in a metric space to have small intersection. Roughly speaking, this happens when the metric space is (i) expanding and (ii) well-spread, …