Zoltán Szigeti

activity

20202024

most citedA

4/3

-Approximation Algorithm for the Minimum

2

-Edge Connected Multisubgraph Problem in the Half-Integral Case

2 citations · 2 across the 5 of their papers we have counts for

collaborators

Showing 2024 · math.COShow all

3 papers · 2 filters

math.CO2024

Augmenting a hypergraph to have a matroid-based $(f, g)$ -bounded $(α, β)$ -limited packing of rooted hypertrees

Pierre Hoppenot, Zoltán Szigeti

The aim of this paper is to further develop the theory of packing trees in a graph. We first prove the classic result of Nash-Williams \cite{NW} and Tutte \cite{Tu} on packing span…

math.CO2024

On arborescence packing augmentation in hypergraphs

Pierre Hoppenot, Zoltán Szigeti

We deepen the link between two classic areas of combinatorial optimization: augmentation and packing arborescences. We consider the following type of questions: What is the minimum…

math.CO2024

Matroid-reachability-based decomposition into arborescences

Florian Hörsch, Benjamin Peyrille, Zoltán Szigeti

The problem of matroid-reachability-based packing of arborescences was solved by Király. Here we solve the corresponding decomposition problem that turns out to be more complicated…

Augmenting a hypergraph to have a matroid-based (f,g)-bounded (α,β)-limited packing of rooted hypertrees

On arborescence packing augmentation in hypergraphs

Matroid-reachability-based decomposition into arborescences

Augmenting a hypergraph to have a matroid-based $(f, g)$ -bounded $(α, β)$ -limited packing of rooted hypertrees