Packing mixed hyperarborescences

DOI10.1016/J.DISOPT.2023.100811MaRDI QIDQ6957159zbMATH OpenFDO

Authors Zoltán Szigeti

Publication date 16 July 2025

Published in Discrete Optimization (Search for Journal in Brave)

zbMATH Keywords

packingarborescencemixed hypergraph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Packing mixed hyperarborescences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6957159)