-
Benjamin Bergougnoux, Tight Lower Bounds for Problems Parameterized by Rank-width
Benjamin Bergougnoux, Tight Lower Bounds for Problems Parameterized by Rank-width
We show that there is no
35 events found.
Virtual Discrete Math Colloquium
Calendar of Events
S Sun
M Mon
T Tue
W Wed
T Thu
F Fri
S Sat
0 events,
0 events,
0 events,
1 event,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Robert Hickingbotham, Treewidth, Circle Graphs and Circular Drawings
Robert Hickingbotham, Treewidth, Circle Graphs and Circular Drawings
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 treewidth. This includes examples that are far from the `usual suspects'. Our results imply that treewidth and Hadwiger number are linearly tied on the class …
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Daniel Altman, On an arithmetic Sidorenko conjecture, and a question of Alon
Daniel Altman, On an arithmetic Sidorenko conjecture, and a question of Alon
Let