Seminár z teórie grafov - Gil Puig Surroca (22.10.2026)
vo štvrtok 22.10.2026 o 9:50 hod. v miestnosti M 213
Prednášajúci: Gil Puig Surroca
Názov prednášky: Dichoosability of graphs with high choosability
Termín: 22.10.2026, 9:50 hod., M 213
Abstrakt:
A conjecture of Erdős and Neumann-Lara from 1979 says that, if every orientation of a graph G can be partitioned into k acyclic subgraphs, then the chromatic number of G is at most f(k), where f is a function that is independent of G. We will discuss the list version of this conjecture, and explain how it can be approached using ideas of Alon about the choosability of graphs with large minimum degree.
Joint work with Ararat Harutyunyan and Lucas Picasarri-Arrieta.