On March 10, 2022, Fedor Fomin from the University of Bergen gave an online talk at the Virtual Discrete Math Colloquium on the parameterized complexity of determining whether a 2-connected graph has a cycle of length at least k plus the bound given by the Dirac’s theorem or the Erdős-Gallai theorem. The title of his talk was “Long cycles in graphs: Extremal Combinatorics meets Parameterized Algorithms“.
Fedor Fomin gave an online talk on fixed-parameter algorithms to decide whether a 2-connected graph has a cycle whose length is at least k plus the bound given by the Dirac’s theorem or the Erdős-Gallai theorem at the Virtual Discrete Math Colloquium
