Benjamin Bergougnoux, Tight Lower Bounds for Problems Parameterized by Rank-width
Zoom ID: 869 4632 6610 (ibsdimag)We show that there is no
10 events found.
Raphael Steiner, Strengthening Hadwiger’s conjecture for 4- and 5-chromatic graphs
Room B332 IBS (기초과학연구원)Hadwiger's famous coloring conjecture states that every t-chromatic graph contains a
Robert Hickingbotham, Treewidth, Circle Graphs and Circular Drawings
Zoom ID: 869 4632 6610 (ibsdimag)A circle graph is an intersection graph of a set of chords of a circle. In this talk, I will describe the unavoidable induced subgraphs of circle graphs with large …
Meike Hatzel, Fixed-Parameter Tractability of Directed Multicut with Three Terminal Pairs Parametrised by the Size of the Cutset: Twin-Width Meets Flow-Augmentation
Room B332 IBS (기초과학연구원)We show fixed-parameter tractability of the Directed Multicut problem with three terminal pairs (with a randomized algorithm). This problem, given a directed graph
Daniel Altman, On an arithmetic Sidorenko conjecture, and a question of Alon
Zoom ID: 224 221 2686 (ibsecopro)Let
Maya Sankar, The Turán Numbers of Homeomorphs
Room B332 IBS (기초과학연구원)Let
Eunjin Oh (오은진), Parameterized algorithms for the planar disjoint paths problem
Room B332 IBS (기초과학연구원)Given an undirected planar graph
Marcelo Sales, On Pisier type problems
Zoom ID: 224 221 2686 (ibsecopro)A subset
Stijn Cambie, Recent progress on the Union-closed conjecture and related
Room B332 IBS (기초과학연구원)We give a summary on the work of the last months related to Frankl's Union-Closed conjecture and its offsprings. The initial conjecture is stated as a theorem in extremal set …
Paul Seymour, A loglog step towards the Erdős-Hajnal conjecture
Zoom ID: 869 4632 6610 (ibsdimag)In 1977, Erdős and Hajnal made the conjecture that, for every graph