On covering intersecting set-systems by digraphs

DOI10.1016/S0012-365X(00)00381-2MaRDI QIDQ5936065zbMATH OpenOpenAlexWikidataFDO

Authors 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

aborescencebranchingscoveringdigraphskernel systems

Mathematics Subject Classification ID

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

Review text

The author presents a common generalization of a theorem of Edmonds on the number of disjoint branchings, and a theorem of Frank on kernel systems.

Cited in

(8)

• The \(b\)-branching problem in digraphs
• 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
• A Survey on Covering Supermodular Functions
• The complexity of finding arc-disjoint branching flows
• Stronger bounds and faster algorithms for packing in generalized kernel systems
• scientific article; zbMATH DE number 7378329 (Why is no real title available?)

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

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