Covering a supermodular-like function in a mixed hypergraph
Combinatorics
2024-02-09 v1
Abstract
In this paper, we solve a conjecture by Szigeti in [Matroid-rooted packing of arborescences, submitted], which characterizes a mixed hypergraph having an orientation of such that for every subpartition of , where is an integer-valued, intersecting supermodular function on and a submodular function on . As a corollary, another conjecture in the same paper is confirmed, which characterizes a mixed hypergraph having a packing of mixed hyperarborescences such that their roots form a basis in a given matroid, each vertex belongs to exactly of them and is the root of at least and at most of them.
Cite
@article{arxiv.2402.05458,
title = {Covering a supermodular-like function in a mixed hypergraph},
author = {Hui Gao},
journal= {arXiv preprint arXiv:2402.05458},
year = {2024}
}