English

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 F=(V,EA)\mathcal{F}=(V, \mathcal{E} \cup \mathcal{A}) having an orientation E\overrightarrow{\mathcal{E}} of E\mathcal{E} such that eEA(P)XPh(X)b(P)e_{\overrightarrow{\mathcal{E}} \cup \mathcal{A}} (\mathcal{P}) \geq \sum_{X \in \mathcal{P}}h(X) -b(\cup \mathcal{P}) for every subpartition P\mathcal{P} of VV, where hh is an integer-valued, intersecting supermodular function on VV and bb a submodular function on VV. 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 vv belongs to exactly kk of them and is the root of at least f(v)f(v) and at most g(v)g(v) 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}
}
R2 v1 2026-06-28T14:42:33.790Z