Packing branchings under cardinality constraints on their root sets

DOI10.1016/j.ejc.2020.103212zbMath1458.05090arXiv1908.10795OpenAlexW3080585646MaRDI QIDQ2225417

Daqing Yang, Hui Gao

Publication date: 8 February 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.10795

zbMATH Keywords

arborescence augmentationarborescences in a digraph

Mathematics Subject Classification ID

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

Related Items (2)

Packing of spanning mixed arborescences ⋮ Packing of maximal independent mixed arborescences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on disjoint arborescences
• On the higher-order edge toughness of a graph
• Arc-disjoint in-trees in directed graphs
• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• An application of submodular flows
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• On two minimax theorems in graph
• Extensions of matroid covering and packing
• Old and new results on packing arborescences in directed hypergraphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On reachability mixed arborescence packing
• Packing in generalized kernel systems: a framework that generalizes packing of branchings
• Covering Intersecting Bi-set Families under Matroid Constraints
• On Maximal Independent Arborescence Packing
• Variations for Lovász’ Submodular Ideas
• Arc‐disjoint arborescences of digraphs
• Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings
• Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation
• Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs
• Matroid-Based Packing of Arborescences
• Arborescence Problems in Directed Graphs: Theorems and Algorithms
• A generalization of Kónig's theorem
• Decomposition of Finite Graphs Into Forests
• On covering intersecting set-systems by digraphs

This page was built for publication: Packing branchings under cardinality constraints on their root sets