Speaker: Zoltan Szigeti
Title: Evolution of arborescence packing
Room: D209
Date: 27/05/2025 14:00
Abstract:
I will present a general result on packing arborescences, namely the characterization of the existence of an ''h-regular M-independent-rooted (f, g)-bounded (α, β)-limited packing of mixed hyperarborescences’’.
The problem can be described as follows: we are given a mixed hypergraph F and a matroid M on its vertex set; we want to decide whether there exists a set B of mixed hyperarborescences in F such that
the mixed hyperarborescences in B are hyperedge and hyperarc disjoint,
each vertex of F is a head or the root in h mixed hyperarborescences in B,
the roots of the mixed hyperarborescences in B form an independent set in the matroid M,
the number of mixed v-hyperarborescences in B is at least f(v) and at most g(v) for every vertex v of F,
the number of the mixed hyperarborescences in B is at least α and at most β.
This result provides a common generalization of a great number of earlier results on packing arborescences:
Edmonds: packing of k spanning arborescences with fixed roots,
Frank: packing of k spanning arborescences with flexible roots,
Frank, Cai: (f,g)-bounded packing of k spanning arborescences,
Frank: packing of k spanning mixed arborescences with fixed roots,
Gao, Yang: packing of k spanning mixed arborescences with flexible roots,
Frank, Király, Király: packing of k spanning hyperarborescences with fixed roots,
Fortier, Király, Léonard, Szigeti, Talon: packing of k spanning mixed hyperarborescences with fixed roots,
Hörsch, Szigeti: (f,g)-bounded packing of k spanning mixed hyperarborescences,
Bérczi, Frank: h-regular (f, g)-bounded (α, β)-limited packing of arborescences,
Szigeti: h-regular (f, g)-bounded (α, β)-limited packing of mixed hyperarborescences,
Szigeti: h-regular M-basis-rooted (f, g)-bounded packing of mixed arborescences,
Gao+Szigeti: h-regular M-basis-rooted (f, g)-bounded packing of mixed hyperarborescences.