Paul Seymour, Polynomial bounds for chromatic number
Zoom ID: 869 4632 6610 (ibsdimag)The Gyárfás-Sumner conjecture says that for every forest
The Gyárfás-Sumner conjecture says that for every forest
Majority dynamics on a graph
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 …
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 …
A family
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