On covering intersecting set-systems by digraphs

DOI10.1016/S0012-365X(00)00381-2zbMath0993.05116OpenAlexW2112607208WikidataQ127813496 ScholiaQ127813496MaRDI QIDQ5936065

László Szegő

Publication date: 2 July 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00381-2

zbMATH Keywords

coveringdigraphsaborescencebranchingskernel systems

Mathematics Subject Classification ID

Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

The complexity of finding arc-disjoint branching flows ⋮ Stronger bounds and faster algorithms for packing in generalized kernel systems ⋮ The \(b\)-branching problem in digraphs ⋮ Unnamed Item ⋮ A Survey on Covering Supermodular Functions ⋮ Packing branchings under cardinality constraints on their root sets ⋮ Packing in generalized kernel systems: a framework that generalizes packing of branchings ⋮ Covering Intersecting Bi-set Families under Matroid Constraints

This page was built for publication: On covering intersecting set-systems by digraphs