location: Current position: Home >> Scientific research >> Paper achievements

Extensions of matroid covering and packing

Hits :

Correspondence Author : Daqing Yang

Author : Fan, Genghua; Jiang, Hongbi; Li, Ping; West, Douglas B.; Yang, Daqing; Zhu, Xuding

Date of Publication : 2019-01-01

Journal : European Journal of Combinatorics

Affiliation of Author(s) : 数理与信息工程学院

Volume : Vol.76

Page Number : 117-122

ISSN : 0195-6698

Abstract : Let M be a loopless matroid on E with rank function r M . Let β  = max 0̸ ≠ X ⊆ E | X | r M  and φ  = min r M  < r  | E | − | X | r M  − r M  . The Matroid Covering and Packing Theorems state that the minimum number of independent sets whose union is E is

Translation or Not : no

Next One : Decomposing a graph into forests and a matching

Recommend this Article