Computing a maximum independent set in a graph embedded in a fixed surface when the odd cycle packing number is bounded

Wed, Jan 16, 2019 12:30 CET

Speakers: Samuel Fiorini

Tags: Graphs, Graph Embedding, Maximum Independent Set

Tomorrow Sam will tell us how to compute a maximum independent set in a graph embedded in a fixed surface if there are not many disjoint odd cycles in the graph.

Note the unusual room: NO8.202 ("petit séminaire"), because of exams taking place in the other rooms.